On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms
From MaRDI portal
Publication:3087941
DOI10.1007/978-3-642-22685-4_8zbMath1334.68107OpenAlexW1017985MaRDI QIDQ3087941
Xiao Zhou, Takanori Aoki, Takehiro Ito, Kei Uchizawa, Akira Suzuki
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
Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
Rainbow connections for outerplanar graphs with diameter 2 and 3 ⋮ On the rainbow connectivity of graphs: complexity and FPT algorithms ⋮ Rainbow connections of graphs: a survey ⋮ A survey on rainbow (vertex-)index of graphs ⋮ On rainbow total-coloring of a graph
This page was built for publication: On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms