4-connected polyhedra have at least a linear number of Hamiltonian cycles
type: Item
instance of: scholarly article
title: 4-connected polyhedra have at least a linear number of Hamiltonian cycles
zbMATH Open document ID: 1469.05097
author: Gunnar Brinkmann
author: Nico Van Cleemput
published in: European Journal of Combinatorics
publication date: 2021-08-05T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 52B05
zbMATH DE Number: 7379262
zbMATH Keywords: 3-connected plane graphs
zbMATH Keywords: Hamiltonian cycles
describes a project that uses: House of Graphs
describes a project that uses: plantri
MaRDI profile type: Publication
full work available at URL: j.ejc.2021.103395
OpenAlex ID: W3178022067
Wikidata QID: Q114184727
cites work: Cycles in 5-connected triangulations
cites work: House of Graphs: a database of interesting graphs
cites work: On the number of hamiltonian cycles in triangulations with few separating triangles
cites work: Polyhedra with few 3-cuts are Hamiltonian
cites work: On the number of hamiltonian cycles in a maximal planar graph
cites work: Hamilton cycles in plane triangulations
cites work: On Hamilton cycles in certain planar graphs
cites work: A theorem on paths in planar graphs
cites work: A Theorem on Planar Graphs
DOI: 10.1016/J.EJC.2021.103395
description: scientific article; zbMATH DE number 7379262