2 citations · 3 across the 3 of their papers we have counts for
3 papers
math.CO2011
On Rainbow Connection Number and Connectivity
L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad
Rainbow connection number, , of a connected graph is the minimum number of colours needed to colour its edges, so that every pair of vertices is connected by at least on…
math.CO2011★ 1 cited
Sharp upper bound for the rainbow connection numbers of 2-connected graphs
Xueliang Li, Sujuan Liu
An edge-colored graph , where adjacent edges may be colored the same, is rainbow connected if any two vertices of are connected by a path whose edges have distinct colors. T…
math.CO2010★ 2 cited
The (strong) rainbow connection numbers of Cayley graphs of Abelian groups
Hengzhe Li, Xueliang Li, Sujuan Liu
A path in an edge-colored graph , where adjacent edges may have the same color, is called a rainbow path if no two edges of the path are colored the same. The rainbow connection…