The rainbow connection number of 2-connected graphs
Combinatorics
2011-10-27 v1
Abstract
The rainbow connection number of a graph G is the least number of colours in a (not necessarily proper) edge-colouring of G such that every two vertices are joined by a path which contains no colour twice. Improving a result of Caro et al., we prove that the rainbow connection number of every 2-connected graph with n vertices is at most the ceiling of n/2. The bound is optimal.
Keywords
Cite
@article{arxiv.1110.5736,
title = {The rainbow connection number of 2-connected graphs},
author = {Jan Ekstein and Přemysl Holub and Tomáš Kaiser and Maria Koch and Stephan Matos Camacho and Zdeněk Ryjáček and Ingo Schiermeyer},
journal= {arXiv preprint arXiv:1110.5736},
year = {2011}
}