Generalized rainbow connectivity of graphs

DOI10.1007/978-3-642-36065-7_22MaRDI QIDQ4914451zbMATH OpenOpenAlexFDO

Authors Kei Uchizawa, Takanori Aoki, Takehiro Ito, Xiao Zhou

Publication date 12 April 2013

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36065-7_22

Mathematics Subject Classification ID

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

Recommendations

• Generalized rainbow connectivity of graphs
• On the rainbow connectivity of graphs: complexity and FPT algorithms
• On the rainbow connectivity of graphs: complexity and FPT algorithms
• Rainbow connectivity: hardness and tractability
• Hardness and Algorithms for Rainbow Connectivity

Cited in

(7)

• Generalized rainbow connection of graphs and their complements
• An Algebraic Characterization of Rainbow Connectivity
• On the rainbow connectivity of graphs: complexity and FPT algorithms
• On the rainbow connectivity of graphs: complexity and FPT algorithms
• scientific article; zbMATH DE number 7008238 (Why is no real title available?)
• Rainbow graph splitting
• Generalized rainbow connectivity of graphs

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 Q4914451)