Abstract
We answer an open question on planar non-hamiltonian bihomogeneously traceable digraphs without opposite arcs by constructing an infinite family of such graphs.
Similar content being viewed by others
References
Bermond J.-C., Simões-Pereira J.M.S., Zamfirescu C.M.: On hamiltonian homogeneously traceable digraphs. Math. Jpn. 24, 423–426 (1979)
Fouquet J.-L., Jolivet J.-L.: Hypohamiltonian oriented graphs. Cahiers Centre Études Rech. Opér 20, 171–181 (1978)
Grötschel M., Wakabayashi Y.: Hypohamiltonian digraphs. J. Methods Oper. Res. 36, 99–119 (1980)
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: Proc. Fourth Int. Conf. on the Theory and Appl. of Graphs, Kalamazoo (MI) 1980, pp. 517–527. Wiley, New York (1981)
Skupień, Z.: Exponential constructions of some nonhamiltonian minima. In: Proc. Fourth CS Symposium on Combinatorics, Graphs and Complexity, Prachatice 1990, Ann. Discrete Math., vol. 51, pp. 321–328 (1992)
Thomassen, C.: Hypohamiltonian graphs and digraphs. In: Proc. Int. Conf. on the Theory and Appl. of Graphs, Kalamazoo (MI) 1976, Lect. Notes Math., vol. 642, pp. 557–571. Springer, Berlin (1978)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zamfirescu, C.T. An Infinite Family of Planar Non-Hamiltonian Bihomogeneously Traceable Oriented Graphs. Graphs and Combinatorics 26, 141–146 (2010). https://doi.org/10.1007/s00373-010-0900-6
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-010-0900-6