Connected Vertex Cover for (sP_1+P_5)-Free Graphs

12/22/2017

∙

by   Matthew Alastair Johnson, et al.

∙

0

∙

share

The Connected Vertex Cover problem is to decide if a graph G has a vertex cover of size at most k that induces a connected subgraph of G. A graph is H-free if it does not contain H as an induced subgraph. We prove that Connected Vertex Cover is polynomial-time solvable for (sP_1+P_5)-free graphs for all s≥ 0.