A sharp upper bound for the rainbow 2-connection number of a 2-connected graph

DOI10.1016/j.disc.2012.12.014zbMath1260.05062arXiv1204.0392OpenAlexW2964109324MaRDI QIDQ1942665

Sujuan Liu, Xue Liang Li

Publication date: 19 March 2013

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

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

zbMATH Keywords

ear decompositionrainbow path2-connected graphrainbow edge-coloringrainbow \(k\)-connection number

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (3)

Rainbow connection in some digraphs ⋮ Rainbow 2-connection numbers of Cayley graphs ⋮ The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths

This page was built for publication: A sharp upper bound for the rainbow 2-connection number of a 2-connected graph