Complexity of the (Connected) Cluster Vertex Deletion problem on $H$-free graphs

Hoang-Oanh Le, Van Bang Le

The well-known Cluster Vertex Deletion problem (CVD) asks for a given graph $G$ and an integer $k$ whether it is possible to delete a set $S$ of at most $k$ vertices of $G$ such th…