Rainbow connection number, bridges and radius (Q2637724)

The authors consider finite, simple, undirected graphs with edge colourings. An edge-coloured graph \(G\) is called rainbow-connected if every two vertices of \(G\) are connected by a path whose edges have different colours. The rainbow connection number of \(G\) is the least number of colours such that \(G\) is rainbow-connected. The present paper deals with rainbow connection numbers of graphs with bridges and their upper bounds, generalizing a result of \textit{M. Basavaraju} et al. [``Rainbow connection number and radius'', Preprint, \url{arXiv:1011.0620v1}], and a new proof technique is presented.