13 citations · 26 across the 9 of their papers we have counts for
Showing 2011 · math.COShow all
3 papers · 2 filters
math.CO2011★ 1 cited
Further hardness results on the rainbow vertex-connection number of graphs
Lily Chen, Xueliang Li, Huishu Lian
A vertex-colored graph is {\it rainbow vertex-connected} if any pair of vertices in are connected by a path whose internal vertices have distinct colors, which was introduc…
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…