Generalized rainbow connection of graphs and their complements

DOI10.7151/DMGT.2011zbMath1390.05068OpenAlexW2755526673MaRDI QIDQ1708384

Meiqin Wei, Colton Magnant, Xiaoyu Zhu, Xue Liang Li

Publication date: 23 March 2018

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2011

zbMATH Keywords

\((k, \ell)\)-rainbow connected\((k, \ell)\)-rainbow connection number\(\ell\)-rainbow path

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (1)

(1, 2)-rainbow connection number at most 3 in connected dense graphs

Cites Work

• Rainbow connection in 3-connected graphs
• Proper connection of graphs
• Rainbow connections of graphs: a survey
• Rainbow connection in graphs
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalized rainbow connection of graphs and their complements