A characterization of near outer-planar graphs
Tanya Lueder · 2010
This thesis focuses on graphs containing an edge whose removal results in an outer-planar graph. We present partial results towards the larger goal of describing the class of all such graphs in terms of a finite list of excluded graphs. Specifically, we give a complete description of those members of this list that are not 2-connected or do not contain a subdivision of a three-spoke wheel. We also show that no members of the list contain a five-spoke wheel.