A nonplanar graph G is called almost-planar if for every edge e of G, at least one of G\e and G/e is planar. In 1990, Gubser characterized 3-connected almost-planar graphs in his dissertation. However, his proof is so long that only a small portion of it was published. The main purpose of this paper is to provide a short proof of this result. We also discuss the structure of almost-planar graphs that are not 3-connected.
Publication Source (Journal or Book title)
Electronic Journal of Combinatorics
Ding, G., Fallon, J., & Marshall, E. (2018). On almost-planar graphs. Electronic Journal of Combinatorics, 25 (1) https://doi.org/10.37236/6591