Doctor of Philosophy (PhD)
In this dissertation, we study nearly planar graphs, that is, graphs that are edgeless or have an edge whose deletion results in a planar graph. We show that all but finitely many graphs that are not nearly planar and do not contain one particular graph have a well-understood structure based on large Möbius ladders.
Document Availability at the Time of Submission
Release the entire work immediately for access worldwide.
Choi, Kwang Ju, "A characterization of almost all minimal not nearly planar graphs" (2013). LSU Doctoral Dissertations. 2011.