Rainbow connection number of dense graphs

DOI10.7151/dmgt.1692zbMath1275.05022arXiv1110.5772OpenAlexW1986612024MaRDI QIDQ2857035

Meng-Meng Liu, Ingo Schiermeyer, Xue Liang Li

Publication date: 31 October 2013

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

Full work available at URL: https://arxiv.org/abs/1110.5772

zbMATH Keywords

edge-colored graphrainbow connection numberrainbow coloring

Mathematics Subject Classification ID

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

Related Items (18)

Finite families of forbidden subgraphs for rainbow connection in graphs ⋮ Sufficient conditions for 2-rainbow connected graphs ⋮ The rainbow connection number of the power graph of a finite group ⋮ Conflict-free connections of graphs ⋮ Proper rainbow connection number of graphs ⋮ Proper connection and size of graphs ⋮ Graphs with small total rainbow connection number ⋮ Upper bounds of proper connection number of graphs ⋮ Rainbow connections of graphs: a survey ⋮ Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2 ⋮ On forbidden subgraphs and rainbow connection in graphs with minimum degree 2 ⋮ Graphs with vertex rainbow connection number two ⋮ Rainbow connection in some digraphs ⋮ Erdős-Gallai-type results for colorful monochromatic connectivity of a graph ⋮ Some extremal results on the colorful monochromatic vertex-connectivity of a graph ⋮ Minimum degree and size conditions for the proper connection number of graphs ⋮ Conflict-free connection number and size of graphs ⋮ Rainbow connection and forbidden subgraphs

This page was built for publication: Rainbow connection number of dense graphs