Rainbow connection number of dense graphs
Xue Liang Li, Mengmeng Liu, Ingo Schiermeyer · Discussiones Mathematicae Graph Theory · 2013
An edge-colored graph G is rainbow connected, if any two vertices are connected by a path whose edges have distinct colors.The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in order to make G rainbow connected.In this paper we show that rc