Generalized rainbow connectivity of graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Color-coding
- Generalized rainbow connectivity of graphs
- Graph Classes: A Survey
- Hardness and algorithms for rainbow connection
- On rainbow connection
- On the rainbow connectivity of graphs: complexity and FPT algorithms
- Rainbow connection in graphs
- Rainbow connection number and connected dominating sets
- Rainbow connectivity: hardness and tractability
- The parameterized complexity of some minimum label problems
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree
- The rainbow connectivity of a graph
Cited in
(6)- On the rainbow connectivity of graphs: complexity and FPT algorithms
- On the rainbow connectivity of graphs: complexity and FPT algorithms
- An Algebraic Characterization of Rainbow Connectivity
- Generalized rainbow connectivity of graphs
- scientific article; zbMATH DE number 7008238 (Why is no real title available?)
- Generalized rainbow connection of graphs and their complements
This page was built for publication: Generalized rainbow connectivity of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744052)