Counting on Rainbow k-Connections
- 3 May 2024
- book chapter
- Published by Springer Nature
- p. 272-283
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- On the complexity of rainbow coloring problemsDiscrete Applied Mathematics, 2018
- Graph Theory2017
- Fundamentals of Parameterized Complexity2013
- Hardness and algorithms for rainbow connectionJournal of Combinatorial Optimization, 2009
- The rainbow connectivity of a graphNetworks, 2009
- Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects2008
- The Relative Complexity of Approximate Counting ProblemsAlgorithmica, 2003
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- The monadic second-order logic of graphs. I. Recognizable sets of finite graphsInformation and Computation, 1990
- Graph Theory with Applications1976