Generalized rainbow connectivity of graphs
DOI10.1016/J.TCS.2014.01.007zbMATH Open1305.05116OpenAlexW2140424448MaRDI QIDQ744052FDOQ744052
Authors: Kei Uchizawa, Takanori Aoki, Takehiro Ito, Xiao Zhou 
Publication date: 6 October 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.01.007
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Cites Work
- Title not available (Why is that?)
- Graph Classes: A Survey
- On rainbow connection
- Rainbow connection number and connected dominating sets
- The rainbow connectivity of a graph
- Rainbow connection in graphs
- On the rainbow connectivity of graphs: complexity and FPT algorithms
- Color-coding
- Hardness and algorithms for rainbow connection
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree
- Rainbow connectivity: hardness and tractability
- The parameterized complexity of some minimum label problems
- Generalized rainbow connectivity of graphs
Cited In (5)
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)
