On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations

DOI10.1002/jgt.21915zbMath1346.05149OpenAlexW1770335600MaRDI QIDQ2825481

Gunnar Brinkmann, Jasper Souffriau, Nicolas Van Cleemput

Publication date: 13 October 2016

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21915

zbMATH Keywords

Hamiltonian cycleplane triangulationmaximal planar graphdecomposition tree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ Polyhedra with few 3-cuts are Hamiltonian ⋮ Hamiltonian properties of polyhedra with few 3-cuts. A survey ⋮ Types of triangle in Hamiltonian triangulations and an application to domination and k-walks ⋮ Hamiltonian-connectedness of triangulations with few separating triangles

Uses Software

• House of Graphs
• plantri

Cites Work

• Unnamed Item
• Unnamed Item
• Any maximal planar graph with only one separating triangle is Hamiltonian
• A theorem on graphs
• House of Graphs: a database of interesting graphs
• Tough graphs and Hamiltonian circuits.
• Hamilton cycles in plane triangulations

This page was built for publication: On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations