Six variations on a theme: almost planar graphs
Max Lipton, Eoin Mackall, Thomas W. Mattman, Mike Pierce, Samantha Robinson, Jeremy Thomas, Ilan Weinschelbaum · Involve a Journal of Mathematics · 2017
A graph is apex if it can be made planar by deleting a vertex, that is, there exists [math] such that [math] is planar. We also define several related notions; a graph is edge apex if there exists [math] such that [math] is planar, and contraction apex if there exists [math] such that [math] is planar. Additionally we define the analogues with a universal quantifier: for all [math] , [math] is planar; for all [math] , [math] is planar; and for all [math] , [math] is planar. The graph minor theorem of Robertson and Seymour ensures that each of these six notions gives rise to a finite set of obstruction graphs. For the three definitions with universal quantifiers we determine this set. For the remaining properties, apex, edge apex, and contraction apex, we show there are at least 36, 55, and 82 obstruction graphs respectively. We give two similar approaches to almost nonplanar (there exists [math] such that [math] is nonplanar, and for all [math] , [math] is nonplanar) and determine the corresponding minor minimal graphs.