Bounds for the rainbow connection number of graphs

DOI10.7151/dmgt.1553zbMath1234.05132OpenAlexW2023769994MaRDI QIDQ3089362

Ingo Schiermeyer

Publication date: 24 August 2011

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

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

zbMATH Keywords

boundsextremal problemrainbow connection numberrainbow connectivityrainbow colouring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (9)

Rainbow connection number, bridges and radius ⋮ Rainbow connection number and independence number of a graph ⋮ Tight upper bound of the rainbow vertex-connection number for 2-connected graphs ⋮ (Strong) rainbow connection on the splitting of 3-path ⋮ Rainbow connection in some digraphs ⋮ Rainbow vertex-connection and graph products ⋮ Rainbow connection and graph products ⋮ Rainbow connectivity and rainbow criticality on graph classes ⋮ Color code techniques in rainbow connection

This page was built for publication: Bounds for the rainbow connection number of graphs