Minor-minimal non-projective planar graphs with an internal 3-separation

详细信息    查看全文

• 作者：Arash  ; Asadi¹ ;   ; ^{aasadi@math.gatech.edu} ; Luke  ; Postle² ;   ; ^{ljpostle@math.gatech.edu} ; Robin  ; Thomas³ ;   ; ^{thomas@math.gatech.edu}
• 关键词：Minor-minimal non-projective planar graphs ; Internal 3-separation ; Internally 4-connected
• 刊名：Electronic Notes in Discrete Mathematics
• 出版年：2011
• 出版时间：1 December 2011
• 年：2011
• 卷：38
• 期：Complete
• 页码：69-75
• 全文大小：431 K

文摘

Archdeacon proved that a graph is projective planar if and only if it has no minor isomorphic to a graph from a list of 35 specific graphs. We describe a 2-step strategy to obtain a more modern and hopefully shorter proof of the theorem, and execute the first step.