Abstract
Carsten Thomassen asked in 1976 whether there exists a planar hypohamiltonian oriented graph. We answer his question by presenting an infinite family of planar hypohamiltonian oriented graphs, the smallest of which has order 9. A computer search showed that 9 is the smallest possible order of a hypohamiltonian oriented graph.
Similar content being viewed by others
References
Hahn S., Zamfirescu T.: Bihomogeneously traceable oriented graphs. Rend. Sem. Mat Univ. Politec. Torino 39(2), 137–145 (1981)
Skupień, Z.: On homogeneously traceable nonhamiltonian digraphs and oriented graphs. In: Chartrand, G., Alavi, Y., Goldsmith, D.L., Lesniak-Foster, L., Lick, D.R. (eds.) The Theory and Applications of Graphs (Proc. Fourth Int. Conf. on T.A.G., held in Kalamazoo, MI., 1980), pp. 517–527. Wiley (1981)
Thomassen, C.: Hypohamiltonian graphs and digraphs. In: Proceedings of the International Conference on the Theory and Applications of Graphs, Kalamazoo, 1976, pp. 557–571. Springer Verlag, Berlin (1978)
van Aardt S.A., Frick M., Katrenič P., Nielsen M.H.: The order of hypotraceable oriented graphs. Discret. Math. 311, 1273–1280 (2011)
Zamfirescu C.T.: An infinite family of planar non-hamiltonian bihomogeneusly traceable oriented graphs. Graphs Comb. 26, 141–146 (2010)
Author information
Authors and Affiliations
Corresponding author
Additional information
This material is based upon work supported by the National Research Foundation of S.A. under Grant number 71308.
Rights and permissions
About this article
Cite this article
van Aardt, S.A., Burger, A.P. & Frick, M. An Infinite Family of Planar Hypohamiltonian Oriented Graphs. Graphs and Combinatorics 29, 729–733 (2013). https://doi.org/10.1007/s00373-012-1165-z
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-012-1165-z