Planar F-Deletion: Approximation, Kernelization and Optimal FPT Algorithms

Fedor Fomin, Daniel Lokshtanov, Neeldhara Misra +1

Let F be a finite set of graphs. In the F-Deletion problem, we are given an n-vertex graph G and an integer k as input, and asked whether at most k vertices can be deleted from G s…