Generalized rainbow connectivity of graphs

DOI10.1016/j.tcs.2014.01.007zbMath1305.05116OpenAlexW2140424448MaRDI QIDQ744052

Kei Uchizawa, Takehiro Ito, Xiao Zhou, Takanori Aoki

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

zbMATH Keywords

graph algorithmfixed parameter tractabilitycactusrainbow connectivity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Cites Work

• Unnamed Item
• On the rainbow connectivity of graphs: complexity and FPT algorithms
• Hardness and algorithms for rainbow connection
• On rainbow connection
• The parameterized complexity of some minimum label problems
• Rainbow connection number and connected dominating sets
• New Hardness Results in Rainbow Connectivity
• The rainbow connectivity of a graph
• Rainbow connection in graphs
• Graph Classes: A Survey
• Color-coding
• Generalized Rainbow Connectivity of Graphs
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree

This page was built for publication: Generalized rainbow connectivity of graphs