A Survey on the k-Path Vertex Cover Problem

Jianhua Tu

Given a graph $G=(V,E)$ and a positive integer $k\ge 2$, a $k$-path vertex cover is a subset of vertices $F$ such that every path on $k$ vertices in $G$ contains at least one vertex…