Some results on the rainbow vertex-disconnection colorings of graphs

Yindi Weng

Let $G$ be a nontrivial connected and vertex-colored graph. A vertex subset $X$ is called rainbow if any two vertices in $X$ have distinct colors. The graph $G$ is called \emph{rai…