1 citations · 1 across the 2 of their papers we have counts for
1 paper · 1 filter
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…