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

DOI10.1002/JGT.21915zbMATH Open1346.05149OpenAlexW1770335600MaRDI QIDQ2825481FDOQ2825481

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

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

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)

Cites Work

• House of Graphs: a database of interesting graphs
• Fast generation of planar graphs
• Any maximal planar graph with only one separating triangle is Hamiltonian
• A theorem on graphs
• Tough graphs and Hamiltonian circuits.
• Hamilton cycles in plane triangulations
• Title not available (Why is that?)

Cited In (8)

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

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)