Six variations on a theme: almost planar graphs

Max Lipton, Eoin Mackall, Thomas W. Mattman +4

A graph is apex if it can be made planar by deleting a vertex, that is, $\exists v$ such that $G-v$ is planar. We define the related notions of edge apex, $\exists e$ such that $G-…