Parameterized Algorithms for Deletion to (r, ell)-Graphs

For fixed integers r, l ≥ 0, a graph G is called an (r, l)-graph if the vertex set V (G) can be partitioned into r independent sets and l cliques. This brings us to the following natural parameterized questions: Vertex (r, l)-Partization and Edge (r, l)-Partization. An input to these problems consist of a graph G and a positive integer k and the objective is to decide whether there exists a set S ⊆ V (G) (S ⊆ E(G)) such that the deletion of S from G results in an (r, l)-graph. These problems generalize well studied problems such asOdd Cycle Transversal, Edge Odd Cycle Transversal, Split Vertex Deletion and Split Edge Deletion. We do not hope to get parameterized algorithms for either Vertex (r, l)-Partization or Edge (r, l)-Partization when either of r or l is at least 3 as the recognition problem itself is NP-complete. This leaves the case of r, l ∈ {1, 2}. We almost complete the parameterized complexity dichotomy for these problems by obtaining the following