On the strongest form of a theorem of Whitney for Hamiltonian cycles in plane triangulations

DOI10.1002/JGT.21915MaRDI QIDQ2825481zbMATH OpenOpenAlexFDO

Authors Gunnar Brinkmann, Jasper Souffriau, Nico 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 cyclemaximal planar graphplane triangulationdecomposition tree

Mathematics Subject Classification ID

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

Recommendations

• Hamilton cycles in plane triangulations
• Hamiltonian cycles in planar triangulations with no separating triangles
• Hamilton cycles in maximal planar graphs
• Hamiltonian cycles in 4-connected plane triangulations with few 4-separators
• On Hamiltonian cycles in 4- and 5-connected plane triangulations

Cites work

• scientific article; zbMATH DE number 889961 (Why is no real title available?)
• A theorem on graphs
• Any maximal planar graph with only one separating triangle is Hamiltonian
• Fast generation of planar graphs
• Hamilton cycles in plane triangulations
• House of Graphs: a database of interesting graphs
• Tough graphs and Hamiltonian circuits.

Cited in

(8)

• scientific article; zbMATH DE number 1744075 (Why is no real title available?)
• Polyhedra with few 3-cuts are Hamiltonian
• Hamiltonian cycles in planar triangulations with no separating triangles
• Hamiltonian properties of polyhedra with few 3-cuts. A survey
• Types of triangle in Hamiltonian triangulations and an application to domination and \(k\)-walks
• Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey
• Hamiltonian-connectedness of triangulations with few separating triangles
• An extension of Whitney's theorem to infinite strong triangulations

Describes a project that uses

Uses Software

• House of Graphs
• plantri

This page was built for publication: On the strongest form of a theorem of Whitney for Hamiltonian cycles in plane triangulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2825481)