On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations
From MaRDI portal
Publication:2825481
DOI10.1002/jgt.21915zbMath1346.05149MaRDI 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
05C05: Trees
05C35: Extremal problems in graph theory
05C10: Planar graphs; geometric and topological aspects of graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C45: Eulerian and Hamiltonian graphs
Related Items
Types of triangle in Hamiltonian triangulations and an application to domination and k-walks, Hamiltonian properties of polyhedra with few 3-cuts. A survey, Polyhedra with few 3-cuts are Hamiltonian, Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey, Hamiltonian-connectedness of triangulations with few separating triangles
Uses Software
Cites Work