Rainbow connection in sparse graphs

DOI10.7151/DMGT.1640zbMath1291.05069OpenAlexW2067931229MaRDI QIDQ2866459

Jakub Przybyło, Mariusz Woźniak, Arnfried Kemnitz, Ingo Schiermeyer

Publication date: 13 December 2013

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

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

zbMATH Keywords

rainbow connection numberrainbow colouringrainbow-connected graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (7)

Sufficient conditions for 2-rainbow connected graphs ⋮ Conflict-free connections of graphs ⋮ Proper rainbow connection number of graphs ⋮ Proper connection and size of graphs ⋮ Minimum degree and size conditions for the proper connection number of graphs ⋮ Conflict-free connection number and independence number of a graph ⋮ Conflict-free connection number and size of graphs

This page was built for publication: Rainbow connection in sparse graphs