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


Planar and infinite hypohamiltonian and hypotraceable graphs
Authors:Carsten Thomassen
Affiliation:Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ont., Canada
Abstract:Chvátal raised the question whether or not planar hypohamiltonian graphs exist and Grünbaum conjectured the nonexistence of such graphs. We shall describe an infinite class of planar hypohamiltonian graphs and infinite classes of planar hypotraceable graphs of connectivity two (resp. three). Infinite hypohamiltonian (resp. htpotraceable) graphs are also described. It is shown how the study of infinite hypotraceable graphs leads to a new infinite family of finite hypotraceable graphs.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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