On the rainbow connectivity of graphs: complexity and FPT algorithms

DOI10.1007/978-3-642-22685-4_8zbMATH Open1334.68107OpenAlexW1017985MaRDI QIDQ3087941FDOQ3087941

Authors: Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou 

Publication date: 17 August 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22685-4_8

Recommendations

• On the rainbow connectivity of graphs: complexity and FPT algorithms
• Generalized rainbow connectivity of graphs
• Generalized rainbow connectivity of graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15)

Cited In (10)

• Title not available (Why is that?)
• On the rainbow connectivity of graphs: complexity and FPT algorithms
• Rainbow connections for outerplanar graphs with diameter 2 and 3
• Hardness and Algorithms for Rainbow Connectivity
• Generalized rainbow connectivity of graphs
• Generalized rainbow connectivity of graphs
• Note on the hardness of rainbow connections for planar and line graphs
• Total-rainbow connection and forbidden subgraphs
• On rainbow total-coloring of a graph
• A survey on rainbow (vertex-)index of graphs

This page was built for publication: On the rainbow connectivity of graphs: complexity and FPT algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3087941)