On planar hypohamiltonian graphs
On planar hypohamiltonian graphs
复制标题
DOI：
10.1002/jgt.20513
复制
发表时间：
2011-05
影响因子：
0.9
通讯作者：
G. Wiener;M. Araya
中科院分区：
文献类型：
--
作者：
G. Wiener;M. Araya
我们提出了一个平面hypohamiltonian图的42个顶点和（作为推论）一个平面hypotraceable图的162个顶点，提高了Zamfirescu和Zamfirescu的界限，并显示一些其他的后果。我们还解决了是否存在一个正整数N，使得对任意整数n≥N，存在一个n阶平面亚Hamilton/亚可迹图的公开问题。© 2010 Wiley Periodicals，Inc. J Graph Theory 67：55 - 68，2011
We present a planar hypohamiltonian graph on 42 vertices and (as a corollary) a planar hypotraceable graph on 162 vertices, improving the bounds of Zamfirescu and Zamfirescu and show some other consequences. We also settle the open problem whether there exists a positive integer N, such that for every integer n≥N there exists a planar hypohamiltonian/hypotraceable graph on n vertices. © 2010 Wiley Periodicals, Inc. J Graph Theory 67: 55‐68, 2011