Reconfiguring k-path vertex covers

Duc A. Hoang, Akira Suzuki, Tsuyoshi Yagita

A vertex subset $I$ of a graph $G$ is called a $k$-path vertex cover if every path on $k$ vertices in $G$ contains at least one vertex from $I$. The \textsc{$k$-Path Vertex Cover R…