On almost-planar graphs

被引：0
|
作者：
Ding, Guoli [1 ]
Fallon, Joshua [1 ]
Marshall, Emily [2 ]
机构：
[1] Louisiana State Univ, Dept Math, Baton Rouge, LA 70803 USA
[2] Arcadia Univ, Comp Sci & Math Dept, Glenside, PA USA
来源：
ELECTRONIC JOURNAL OF COMBINATORICS | 2018年 / 25卷 / 01期
关键词：
MATROIDS;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A nonplanar graph G is called almost-planar if for every edge e of G, at least one of G\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.
引用
收藏
页数：14
相关论文
共 50 条
  • [31] DELAUNAY GRAPHS ARE ALMOST AS GOOD AS COMPLETE GRAPHS
    DOBKIN, DP
    FRIEDMAN, SJ
    SUPOWIT, KJ
    DISCRETE & COMPUTATIONAL GEOMETRY, 1990, 5 (04) : 399 - 407
  • [32] Convex drawings of hierarchical planar graphs and clustered planar graphs
    Hong, Seok-Hee
    Nagamochi, Hiroshi
    JOURNAL OF DISCRETE ALGORITHMS, 2010, 8 (03) : 282 - 295
  • [33] Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs
    Seok-Hee Hong
    Peter Eades
    Algorithmica, 2006, 44 : 67 - 100
  • [34] Drawing planar graphs symmetrically, II: Biconnected planar graphs
    Hong, SH
    Eades, P
    ALGORITHMICA, 2005, 42 (02) : 159 - 197
  • [35] Drawing planar graphs symmetrically, III: Oneconnected planar graphs
    Hong, SH
    Eades, P
    ALGORITHMICA, 2006, 44 (01) : 67 - 100
  • [36] Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs
    Seok-Hee Hong
    Peter Eades
    Algorithmica , 2005, 42 : 159 - 197
  • [37] Almost surely almost exact optimization in random graphs
    Faragó, A
    FCS '05: Proceedings of the 2005 International Conference on Foundations of Computer Science, 2005, : 94 - 100
  • [38] Almost flat planar diagrams
    Kazakov, VA
    Staudacher, M
    Wynter, T
    COMMUNICATIONS IN MATHEMATICAL PHYSICS, 1996, 179 (01) : 235 - 256
  • [39] A NOTE ON ALMOST REGULAR GRAPHS
    HOFMEISTER, M
    MATHEMATISCHE NACHRICHTEN, 1994, 166 : 259 - 262
  • [40] Almost Hamiltonian Cubic Graphs
    Punnim, Narong
    Saenpholphat, Varaporn
    Thaithae, Sermsri
    INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2007, 7 (01): : 83 - 86
12345