Hamilton cycles in plane triangulations
From MaRDI portal
Publication:4798110
DOI10.1002/jgt.10057zbMath1012.05106OpenAlexW4230126032MaRDI QIDQ4798110
Publication date: 19 March 2003
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.10057
Related Items (19)
Counting Hamiltonian cycles in planar triangulations ⋮ Every 4-Connected Graph with Crossing Number 2 is Hamiltonian ⋮ Computing Tutte Paths ⋮ On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ A counterexample to prism-Hamiltonicity of 3-connected planar graphs ⋮ Polyhedra with few 3-cuts are Hamiltonian ⋮ Minimal \(k\)-connected non-Hamiltonian graphs ⋮ Non-Hamiltonian triangulations with distant separating triangles ⋮ Hamiltonian cycles in 4-connected plane triangulations with few 4-separators ⋮ Minimum balanced bipartitions of planar triangulations ⋮ Hamiltonian properties of polyhedra with few 3-cuts. A survey ⋮ 4-connected polyhedra have at least a linear number of Hamiltonian cycles ⋮ Types of triangle in Hamiltonian triangulations and an application to domination and k-walks ⋮ On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations ⋮ Number of Hamiltonian Cycles in Planar Triangulations ⋮ Non-Hamiltonian 1-tough triangulations with disjoint separating triangles ⋮ Some remarks on Jaeger's dual-hamiltonian conjecture ⋮ Hamiltonian-connectedness of triangulations with few separating triangles
Cites Work
This page was built for publication: Hamilton cycles in plane triangulations
