Hamiltonian simple polytopes
type: Item
instance of: scholarly article
title: Hamiltonian simple polytopes
zbMATH Open document ID: 0838.52012
DOI: 10.1007/BF02570708
author: Yanyan Li
published in: Discrete \& Computational Geometry
publication date: 1995-10-29T00:00:00Z
full work available at URL: https://eudml.org/doc/131404
review text: The author shows that for every \(n \geq n_0(d)\) there is a simple \(d\)-polytope with \(n\) vertices whose graph contains a Hamiltonian circuit (where \(n_0 (d) \leq cd 2^d)\). This improves an earlier result of Klee, who constructed simple \(d\)-polytopes in which the longest cycle missed at most \(d - 2\) vertices.
Mathematics Subject Classification ID: 52B05
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 810124
zbMATH Keywords: simple polytopes
zbMATH Keywords: Hamiltonian circuit
zbMATH Keywords: longest cycle
reviewed by: Peter Brass
MaRDI profile type: Publication
cites work: A proof of the lower bound conjecture for convex polytopes
cites work: Hamiltonian circuits in certain prisms
cites work: Q4747150
cites work: On Hamiltonian Circuits
Recommended article: Q4873187
Recommended article: On a class of Hamiltonian polytopes
Recommended article: ON HAMILTONIAN TRIANGULATIONS IN SIMPLE POLYGONS
Recommended article: Q4328193
Recommended article: Hamiltonicity in (0-1)-polyhedra
Recommended article: Q3318811
Recommended article: On hamiltonian triangulations in simple polygons (Extended Abstract)
Recommended article: Polyhedra of small order and their Hamiltonian properties
Recommended article: Hamiltonian Systems on Polyhedra
Recommended article: Hamiltonian submanifolds of regular polytopes
description: scientific article; zbMATH DE number 810124