Hamiltonian simple polytopes

DOI10.1007/BF02570708zbMath0838.52012MaRDI QIDQ1900969

Yanyan Li

Publication date: 29 October 1995

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131404

zbMATH Keywords

Hamiltonian circuitlongest cyclesimple polytopes

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Lower bound theorems for general polytopes ⋮ A property of graphs of convex polytopes

Cites Work

• Unnamed Item
• A proof of the lower bound conjecture for convex polytopes
• Hamiltonian circuits in certain prisms
• On Hamiltonian Circuits

This page was built for publication: Hamiltonian simple polytopes