On cubic planar hypohamiltonian and hypotraceable graphs (Q540080)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5903015
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On cubic planar hypohamiltonian and hypotraceable graphs |
scientific article; zbMATH DE number 5903015 |
Statements
On cubic planar hypohamiltonian and hypotraceable graphs (English)
0 references
1 June 2011
0 references
Summary: 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 \geq 86\) and that cubic planar hypotraceable graphs exist on \(n\) vertices for every even number \(n \geq 356\), settling an open question of Holton and Sheehan.
0 references
0.8936679363250732
0 references
0.8674713373184204
0 references
0.8672012090682983
0 references
0.8652207851409912
0 references
0.8388479948043823
0 references
