Rainbow connection in sparse graphs
Arnfried Kemnitz, Jakub Przybyło, Ingo Schiermeyer, Mariusz Woźniak · Discussiones Mathematicae Graph Theory · 2012
An edge-coloured connected graph G = (V, E) is called rainbow-connected if each pair of distinct vertices of G is connected by a path whose edges have distinct colours.The rainbow connection number of G, denoted by rc(G), is the minimum number of colours such that G is rainbow-connected.In this