The question of characterizing graphs H such that the vertex cover problem is solvable in polynomial time in the class of H-free graphs is notoriously difficult and still widely open. We completely solve the corresponding question for a distance-based generalization of vertex cover called distance-k vertex cover, for any positive integer k.

https://link.springer.com/chapter/10.1007/978-3-030-79987-8_17