The rainbow connection number of 2-connected graphs

DOI10.1016/j.disc.2012.04.022zbMath1277.05061arXiv1110.5736OpenAlexW1988454529MaRDI QIDQ383747

Stephan Matos Camacho, Ingo Schiermeyer, Jan Ekstein, Přemysl Holub, Zdeněk Ryjáček, Tomáš Kaiser, Maria Koch

Publication date: 6 December 2013

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

connectivityrainbow connection number

Mathematics Subject Classification ID

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

Related Items (11)

Finite families of forbidden subgraphs for rainbow connection in graphs ⋮ Upper bounding rainbow connection number by forest number ⋮ Rainbow connection number and independence number of a graph ⋮ Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2 ⋮ Strong rainbow connection in digraphs ⋮ Rainbow connection in oriented graphs ⋮ The vertex-rainbow connection number of some graph operations ⋮ On forbidden subgraphs and rainbow connection in graphs with minimum degree 2 ⋮ Rainbow connection number and the number of blocks ⋮ Rainbow connections in digraphs ⋮ Rainbow connection and forbidden subgraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Rainbow connection number and connectivity
• Hardness and algorithms for rainbow connection
• On rainbow connection
• Rainbow connection in graphs
• Rainbow Connection in Graphs with Minimum Degree Three
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree

This page was built for publication: The rainbow connection number of 2-connected graphs