Complexity of Rainbow Vertex Connectivity Problems for Restricted Graph Classes

Juho Lauri

A path in a vertex-colored graph $G$ is \emph{vertex rainbow} if all of its internal vertices have a distinct color. The graph $G$ is said to be \emph{rainbow vertex connected} if…