Geodesic
On almost-planar graphs
Guoli Ding1 ; Joshua Fallon1 ; Emily Marshall2
1Louisiana State University
2Arcadia University
The electronic journal of combinatorics, Tome 25 (2018) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/6591
Classification : 05C75, 05C10, 05C83
Mots-clés : almost-planar graphs, minors

Guoli Ding  1   ; Joshua Fallon  1   ; Emily Marshall  2

1 Louisiana State University
2 Arcadia University 
@article{10_37236_6591,
     author = {Guoli Ding and Joshua Fallon and Emily Marshall},
     title = {On almost-planar graphs},
     journal = {The electronic journal of combinatorics},
     year = {2018},
     volume = {25},
     number = {1},
     doi = {10.37236/6591},
     zbl = {1390.05194},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/6591/}
}
TY  - JOUR
AU  - Guoli Ding
AU  - Joshua Fallon
AU  - Emily Marshall
TI  - On almost-planar graphs
JO  - The electronic journal of combinatorics
PY  - 2018
VL  - 25
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/6591/
DO  - 10.37236/6591
ID  - 10_37236_6591
ER  - 
%0 Journal Article
%A Guoli Ding
%A Joshua Fallon
%A Emily Marshall
%T On almost-planar graphs
%J The electronic journal of combinatorics
%D 2018
%V 25
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/6591/
%R 10.37236/6591
%F 10_37236_6591
Guoli Ding; Joshua Fallon; Emily Marshall. On almost-planar graphs. The electronic journal of combinatorics, Tome 25 (2018) no. 1. doi: 10.37236/6591

Cité par Sources :