Abstract
In this paper, the existence of one-way infinite Hamiltonian paths in an infinite 4-connected strong triangulation is constructively verified, which is an extension of WHITNEY’S theorem to infinite graphs.
Similar content being viewed by others
References
T. Asano, S. Kikuchi andN. Saito. A Linear Algorithm for Finding Hamiltonian Cycles in 4-connected Maximal Planar Graphs. Discrete Appl. Math. 7 (1984), 1–15.
J.A. Bondy and U.S.R. Murty. Graph Theory with Applications. North Holland, New York 1976.
M.B. Dillencourt. Hamiltonian Cycles in Planar Triangulations with no Separating Triangles. J. Graph Th.14 (1990), 31–49.
C.ST.J.A. Nash-Williams. Unexplored and Semi-explored Territories in Graph Theory. New Directions in Graph Theory (ed. F. Harary), Acad. Press, New York 1973, 149–186.
C. Thomassen. Planarity and Duality of Finite and Infinite Graphs J. Comb. Th. (B)29 (1980), 244–271.
C. Thomassen. Infinite Graphs. Sel. Topics in Graph Theory2 (1983) 129–159.
C. Thomassen. A Theorem on Paths in Planar Graphs. J. Graph Th.7 (1983), 137–160.
W.T. Tutte. Bridges and Hamiltonian Circuits in Planar Graphs Aequations Math.15 (1977), 1–3.
H. Whitney. A Theorem on Graphs. Ann. Math.32 (1931), 378–390.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Jung, H.O. An extension of whitney’s theorem to infinite strong triangulations. Abh.Math.Semin.Univ.Hambg. 64, 131–139 (1994). https://doi.org/10.1007/BF02940780
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02940780