most citedThe 3-rainbow index and connected dominating sets

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2014

Note on the upper bound of the rainbow index of a graph

Qingqiong Cai, Xueliang Li, Yan Zhao

A path in an edge-colored graph , where adjacent edges may be colored the same, is a rainbow path if every two edges of it receive distinct colors. The rainbow connection number…

math.CO2014★ 1 cited

The 3-rainbow index and connected dominating sets

Qingqiong Cai, Xueliang Li, Yan Zhao

A tree in an edge-colored graph is said to be rainbow if no two edges on the tree share the same color. An edge-coloring of is called 3-rainbow if for any three vertices in …

math.CO2012

Note on minimally -rainbow connected graphs

Hengzhe Li, Xueliang Li, Yuefang Sun +1

An edge-colored graph , where adjacent edges may have the same color, is {\it rainbow connected} if every two vertices of are connected by a path whose edge has distinct col…