Further results on the rainbow vertex-disconnection of graphs

Xueliang Li, Yindi Weng

Let $G$ be a nontrivial connected and vertex-colored graph. A subset $X$ of the vertex set of $G$ is called rainbow if any two vertices in $X$ have distinct colors. The graph $G$ i…