Further hardness results on the rainbow vertex-connection number of graphs

Lily Chen, Xueliang Li, Huishu Lian

A vertex-colored graph $G$ is {\it rainbow vertex-connected} if any pair of vertices in $G$ are connected by a path whose internal vertices have distinct colors, which was introduc…