On path sequences of graphs

Sławomir Bakalarski, Jakub Zygadło

A subset $S$ of vertices of a graph $G=(V,E)$ is called a $k$-path vertex cover if every path on $k$ vertices in $G$ contains at least one vertex from $S$. Denote by ${\psi }_k(G)$ the m…