This is a preview of subscription content, log in via an institution to check access.
Literatur
Grünbaum, B.: Vertices missed by longest paths or circuits. J. Combinatorial Theory Ser. A17, 31–38 (1974)
Sachs, H.: Ein von Kozyrev und Grin erg angegebener nicht-hamiltonscher kubischer planarer Graph. In: Beiträge zur Graphentheorie, pp. 127–130. Leipzig: Teubner 1968
Thomassen, C.: Planar and infinite hypohamiltonian and hypotraceable graphs. Discrete Math.14, 377–389 (1976)
Tutte, W.T.: Non-hamiltonian planar maps. In: Graph theory and computing, pp. 295–301. Read, R.C., ed.. New York: Academic Press 1972
Zamfirescu, T.: A two-connected planar graph without concurrent longest paths. J. Combinatorial Theory Ser. B13, 116–121 (1972)
Zamfirescu, T.: On longest paths and circuits in graphs. Math. Scand.38, 211–239 (1976)
Zamfirescu, T.: L'histoire et l'état présent des bornes connues pourP j k , C j k , P j k , etC j k . Cahiers Centre Études Recherche Opér.17, 427–439 (1975)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hatzel, W. Ein planarer hypohamiltonscher Graph mit 57 Knoten. Math. Ann. 243, 213–216 (1979). https://doi.org/10.1007/BF01424541
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01424541