On the number of hamiltonian cycles in triangulations with few separating triangles

DOI10.1002/jgt.22149zbMath1380.05119OpenAlexW2619213069MaRDI QIDQ4604024

Gunnar Brinkmann, Jasper Souffriau, Nicolas Van Cleemput

Publication date: 23 February 2018

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

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

zbMATH Keywords

triangulationHamiltonian cyclemaximal planar graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

Counting Hamiltonian cycles in planar triangulations ⋮ Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators ⋮ The ratio of the numbers of odd and even cycles in outerplanar graphs ⋮ Polyhedra with few 3-cuts are Hamiltonian ⋮ Hamiltonian cycles in 4-connected plane triangulations with few 4-separators ⋮ Hamiltonian properties of polyhedra with few 3-cuts. A survey ⋮ 4-connected polyhedra have at least a linear number of Hamiltonian cycles ⋮ Number of Hamiltonian Cycles in Planar Triangulations

This page was built for publication: On the number of hamiltonian cycles in triangulations with few separating triangles