Paper Info
Title
On Cubic Planar Hypohamiltonian and Hypotraceable Graphs.
Abstract
We present a cubic planar hypohamiltonian graph on 70 vertices, improving the best known bound of 94 by Thomassen and derive some consequences concerning longest paths and cycles of planar 3-connected graphs. We also show that cubic planar hypohamiltonian graphs on n vertices exist for every even number n >= 86 and that cubic planar hypotraceable graphs exist on n vertices for every even number n >= 356, settling an open question of Holton and Sheehan.
Year
Venue
Field
2011
ELECTRONIC JOURNAL OF COMBINATORICS
Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Hypohamiltonian graph,Planar,Mathematics
DocType
Volume
Issue
Journal
18.0
1.0
ISSN
Citations 
PageRank 
1077-8926
7
0.61
References 
Authors
8
2
Name
Order
Citations
PageRank
Makoto Araya1268.52
Gábor Wiener26410.65