Elimination Distance to Dominated Clusters

Nicole Schirrmacher, Sebastian Siebertz, Alexandre Vigny

In the Dominated Cluster Deletion problem, we are given an undirected graph $G$ and integers $k$ and $d$ and the question is to decide whether there exists a set of at most $k$ ver…