On Hamiltonian cycles in 4- and 5-connected plane triangulations
From MaRDI portal
Publication:1584430
DOI10.1016/S0012-365X(98)00089-2zbMATH Open0958.05085MaRDI QIDQ1584430FDOQ1584430
Authors: Jochen Harant, T. Böhme 
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- A Theorem on Planar Graphs
- 4-connected projective planar graphs are Hamiltonian
- A theorem on paths in planar graphs
- Bridges and Hamiltonian circuits in planar graphs
- Hamiltonian cycles in planar triangulations with no separating triangles
- Hamiltonicity of 5‐Connected Toroidal Triangulations
- On Hamilton cycles in certain planar graphs
Cited In (13)
- Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs
- Title not available (Why is that?)
- On Hamilton cycles in certain planar graphs
- Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs
- On the number of Hamiltonian cycles in triangulations
- Hamiltonian properties of polyhedra with few 3-cuts. A survey
- Hamiltonian cycles in 4-connected planar and projective planar triangulations with few 4-separators
- Every 5-connected planar triangulation is 4-ordered Hamiltonian
- Cycles in 5-connected triangulations
- Non-Hamiltonian triangulations with distant separating triangles
- Title not available (Why is that?)
- Non-Hamiltonian 1-tough triangulations with disjoint separating triangles
- On the strongest form of a theorem of Whitney for Hamiltonian cycles in plane triangulations
This page was built for publication: On Hamiltonian cycles in 4- and 5-connected plane triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584430)
