A characterization of almost all minimal not nearly planar graphs

Identifier

etd-07082013-134001

Author

Kwang Ju Choi, Louisiana State University and Agricultural and Mechanical CollegeFollow

Degree

Doctor of Philosophy (PhD)

Department

Mathematics

Document Type

Dissertation

Abstract

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.

Date

2013

Document Availability at the Time of Submission

Release the entire work immediately for access worldwide.

Recommended Citation

Choi, Kwang Ju, "A characterization of almost all minimal not nearly planar graphs" (2013). LSU Doctoral Dissertations. 2011.
https://repository.lsu.edu/gradschool_dissertations/2011

Committee Chair

Oporowski, Bogdan

DOI

10.31390/gradschool_dissertations.2011