Obtaining a Planar Graph by Vertex Deletion

Dániel Marx, Ildikó Schlotter

In the k-Apex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor closed class of…