A Characterization of Almost All Minimal not Nearly Planar Graphs
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 larg...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
LSU
2013
|
| Subjects: | |
| Online Access: | http://etd.lsu.edu/docs/available/etd-07082013-134001/ |
| Summary: | 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. |
|---|