19 citations · 21 across the 3 of their papers we have counts for
3 papers
math.CO2011
Asymptotic value of the minimal size of a graph with rainbow connection number 2
Hengzhe Li, Xueliang Li, Yuefang Sun
A path in an edge (vertex)-colored graph , where adjacent edges (vertices) may have the same color, is called a rainbow path if no pair of edges (internal vertices) of the path…
math.CO2011★ 19 cited
The generalized 3-connectivity of Cartesian product graphs
Hengzhe Li, Xueliang Li, Yuefang Sun
The generalized connectivity of a graph, which was introduced recently by Chartrand et al., is a generalization of the concept of vertex connectivity. Let be a nonempty set of…
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…