7 citations · 12 across the 6 of their papers we have counts for
Showing 2011Show all
3 papers · 1 filter
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.CO2011★ 7 cited
Rainbow connection of graphs with diameter 2
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…