On Almost-Planar Graphs
Copyright policy )On Almost-Planar Graphs
A nonplanar graph $G$ is called almost-planar if for every edge $e$ of $G$, at least one of $G\backslash 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.
- Arcadia University United States
- Louisiana State University United States
almost-planar graphs, minors, FOS: Mathematics, Mathematics - Combinatorics, Graph minors, Structural characterization of families of graphs, Combinatorics (math.CO), Planar graphs; geometric and topological aspects of graph theory
almost-planar graphs, minors, FOS: Mathematics, Mathematics - Combinatorics, Graph minors, Structural characterization of families of graphs, Combinatorics (math.CO), Planar graphs; geometric and topological aspects of graph theory
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!