A graph is
apex if it can be made planar by deleting a vertex, that is, there
exists
such that
is planar. We also define several related notions; a graph is
edge apex if there
exists such that
is planar, and
contractionapex if there exists
such that
is planar. Additionally we define the analogues with a universal quantifier: for
all
,
is planar;
for all
,
is planar;
and for all
,
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
such that
is nonplanar,
and for all
,
is nonplanar) and determine the corresponding minor minimal graphs.
Keywords
apex graphs, planar graphs, forbidden minors, obstruction
set