7 citations · 12 across the 6 of their papers we have counts for
6 papers
Rainbow connection number and the number of blocks
Xueliang Li, Sujuan Liu
An edge-colored graph is rainbow connected if every pair of vertices of are connected by a path whose edges have distinct colors. The rainbow connection number of $…
A sharp upper bound for the rainbow 2-connection number of 2-connected graphs
Xueliang Li, Sujuan Liu
A path in an edge-colored graph is called {\em rainbow} if no two edges of it are colored the same. For an -connected graph and an integer with , th…
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…
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…
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…
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…