Hamiltonian simple polytopes

Abstract

We show that for every n> no (d) (n even if d is odd) there exists a simple d-polytope with n vertices, whose graph admits a Hamiltonian circuit. The result sharpens and earlier lower bound due to Victor Klee. © 1995 Springer-Verlag New York Inc.