On Hamiltonian cycles in 4- and 5-connected plane triangulations
From MaRDI portal
Publication:1584430
Recommendations
Cites work
- 4-connected projective planar graphs are Hamiltonian
- A Theorem on Planar Graphs
- 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 in 4-connected planar and projective planar triangulations with few 4-separators
- Non-Hamiltonian 1-tough triangulations with disjoint separating triangles
- scientific article; zbMATH DE number 5239125 (Why is no real title available?)
- Non-Hamiltonian triangulations with distant separating triangles
- scientific article; zbMATH DE number 3908476 (Why is no real title available?)
- On Hamilton cycles in certain planar graphs
- Cycles in 5-connected triangulations
- On the strongest form of a theorem of Whitney for Hamiltonian cycles in plane triangulations
- Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs
- Every 5-connected planar triangulation is 4-ordered Hamiltonian
- Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs
- Hamiltonian properties of polyhedra with few 3-cuts. A survey
- On the number of Hamiltonian cycles in 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)
