An extension of Whitney's theorem to infinite strong triangulations

DOI10.1007/BF02940780zbMath0809.05066MaRDI QIDQ1341252

Hwan-Ok Jung

Publication date: 2 January 1995

Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)

zbMATH Keywords

infinite graphsWhitney's theoreminfinite Hamiltonian pathsstrong triangulation

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

One-way infinite Hamiltonian paths in infinite maximal planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs
• Planarity and duality of finite and infinite graphs
• Bridges and Hamiltonian circuits in planar graphs
• Hamiltonian cycles in planar triangulations with no separating triangles
• On a Quasi‐Ramsey problem

This page was built for publication: An extension of Whitney's theorem to infinite strong triangulations