首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Two graphs without planar covers
Authors:Dan Archdeacon
Abstract:In this note we prove that two specific graphs do not have finite planar covers. The graphs are K7C4 and K4,5–4K2. This research is related to Negami's 1‐2‐∞ Conjecture which states “A graph G has a finite planar cover if and only if it embeds in the projective plane.” In particular, Negami's Conjecture reduces to showing that 103 specific graphs do not have finite planar covers. Previous (and subsequent) work has reduced these 103 to a few specific graphs. This paper covers 2 of the remaining cases. The sole case currently remaining is to show that K2,2,2,1 has no finite planar cover. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 318–326, 2002
Keywords:planar cover  projective plane  Negami's Conjecture
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号