Hamiltonian cycles in planar triangulations with no separating triangles
From MaRDI portal
Publication:4206767
DOI10.1002/jgt.3190140105zbMath0688.05052OpenAlexW2000365433MaRDI QIDQ4206767
Publication date: 1990
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190140105
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)
Related Items
The visibility graph of congruent discs is Hamiltonian ⋮ On certain Hamiltonian inner triangulations ⋮ An extension of Whitney's theorem to infinite strong triangulations ⋮ Finding Hamiltonian cycles in Delaunay triangulations is NP-complete ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ Connectivity of plane triangulations ⋮ Hamiltonian triangulations and circumscribing polygons of disjoint line segments ⋮ Triangulating with high connectivity. ⋮ On the visibility graph of convex translates ⋮ Hamiltonian properties of polyhedra with few 3-cuts. A survey ⋮ Unnamed Item ⋮ On Hamiltonian cycles in 4- and 5-connected plane triangulations
Cites Work
