Parameterized complexity dichotomy for $(r,\ell )$-Vertex Deletion

Julien Baste, Luerbio Faria, Sulamita Klein +1

For two integers $r,\ell \ge 0$, a graph $G=(V,E)$ is an $(r,\ell )$-graph if $V$ can be partitioned into $r$ independent sets and $\ell$ cliques. In the parameterized $(r,\ell…