On the number of hamiltonian cycles in triangulations with few separating triangles
From MaRDI portal
Publication:4604024
DOI10.1002/jgt.22149zbMath1380.05119MaRDI 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
05C35: Extremal problems in graph theory
05C10: Planar graphs; geometric and topological aspects of graph theory
05C45: Eulerian and Hamiltonian graphs
Related Items
Number of Hamiltonian Cycles in Planar Triangulations, Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators, Hamiltonian properties of polyhedra with few 3-cuts. A survey, Polyhedra with few 3-cuts are Hamiltonian, Hamiltonian cycles in 4-connected plane triangulations with few 4-separators, 4-connected polyhedra have at least a linear number of Hamiltonian cycles, Counting Hamiltonian cycles in planar triangulations, The ratio of the numbers of odd and even cycles in outerplanar graphs