A graph G is hypohamiltonian if G is non-hamiltonian and G − v is hamiltonian for every v ∈ V(G). In the following, every graph is assumed to be hypohamiltonian. Aldred, Wormald, and McKay gave a list of all graphs of order at most 17. In this article, we present an algorithm to generate all graphs of a given order and apply it to prove that there exist exactly 14 graphs of order 18 and 34 graphs of order 19. We also extend their results in the cubic case. Furthermore, we show that (i) the smallest graph of girth 6 has order 25, (ii) the smallest planar graph has order at least 23, (iii) the smallest cubic planar graph has order at least 54, and (iv) the smallest cubic planar graph of girth 5 with non-trivial automorphism group has order 78.
@article{1044,
title = {Improved bounds for hypohamiltonian graphs},
journal = {ARS MATHEMATICA CONTEMPORANEA},
volume = {14},
year = {2017},
doi = {10.26493/1855-3974.1044.eaa},
language = {EN},
url = {http://dml.mathdoc.fr/item/1044}
}
Goedgebeur, Jan; Zamfirescu, Carol T. Improved bounds for hypohamiltonian graphs. ARS MATHEMATICA CONTEMPORANEA, Tome 14 (2017) . doi : 10.26493/1855-3974.1044.eaa. http://gdmltest.u-ga.fr/item/1044/