Rainbow connection number and connected
β
L. Sunil Chandran; Anita Das; Deepak Rajendraprasad; Nithin M. Varma
π
Article
π
2011
π
John Wiley and Sons
π
English
β 167 KB
## Abstract The __rainbow connection number__ of a connected graph is the minimum number of colors needed to color its edges, so that every pair of its vertices is connected by at least one path in which no two edges are colored the same. In this article we show that for every connected graph on __