Are all simple 4-polytopes Hamiltonian?
type: Item
instance of: scholarly article
title: Are all simple 4-polytopes Hamiltonian?
zbMATH Open document ID: 0538.05045
DOI: 10.1007/BF02761949
author: Moshe Rosenfeld
published in: Israel Journal of Mathematics
publication date: 1983-01-01T00:00:00Z
review text: A conjecture of D. Barnette says that all simple 4-polytopes are Hamiltonian. The author constructs a large family of non-Hamiltonian 4- connected 4-regular graphs, and proves all of them to be non-polytopal by showing that they may not be the dual graphs of triangulations of the 3- sphere.
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 52Bxx
zbMATH DE Number: 3855154
zbMATH Keywords: Hamiltonian circuit
zbMATH Keywords: 4-polytope
reviewed by: Christoph Schulz
MaRDI profile type: Publication
cites work: Q3097395
cites work: Q5531623
cites work: Polytopes, graphs, and complexes
cites work: Cyclability of r-regular r-connected graphs
cites work: Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
cites work: Hamiltonian circuits in certain prisms
description: scientific article; zbMATH DE number 3855154