1 paper
Rongxia Tang, Henry Liu, Yueping Shi +1
An edge-coloured path is rainbow if all of its edges have distinct colours. Let G be a connected graph. The rainbow connection number of G, denoted by rc(G), is the minimum n…