An Infinite Family of Planar Hypohamiltonian Oriented Graphs
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.
KeywordsHypohamiltonian Bihomogeneously traceable Oriented graph Planar graph
Mathematics Subject Classification05C20 05C38
Unable to display preview. Download preview PDF.
- 2.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)Google Scholar
- 3.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)Google Scholar