The rainbow vertex-disconnection in graphs

Xuqing Bai, You Chen, Ping Li +2

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…