13 citations · 16 across the 3 of their papers we have counts for
3 papers
math.CO2011★ 13 cited
Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph
Lily Chen, Xueliang Li, Mengmeng Liu
A vertex-colored graph is rainbow vertex-connected if any pair of distinct vertices are connected by a path whose internal vertices have distinct colors. The rainbow vertex-con…
math.CO2011★ 3 cited
The complexity of determining the rainbow vertex-connection of graphs
Lily Chen, Xueliang Li, Yongtang Shi
A vertex-colored graph is {\it rainbow vertex-connected} if any two vertices are connected by a path whose internal vertices have distinct colors, which was introduced by Krivelevi…
math.CO2010
Nordhaus-Gaddum-type theorem for rainbow connection number of graphs
Lily Chen, Xueliang Li, Huishu Lian
An edge-colored graph is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of , denoted ,…