Hamiltonian simple polytopes

DOI10.1007/BF02570708MaRDI QIDQ1900969zbMATH OpenFDO

Authors 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

longest cyclesimple polytopesHamiltonian circuit

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 866021
• On a class of Hamiltonian polytopes
• ON HAMILTONIAN TRIANGULATIONS IN SIMPLE POLYGONS
• scientific article; zbMATH DE number 739027
• Hamiltonicity in (0-1)-polyhedra
• scientific article; zbMATH DE number 3849282
• On hamiltonian triangulations in simple polygons (Extended Abstract)
• Polyhedra of small order and their Hamiltonian properties
• Hamiltonian systems on polyhedra
• Hamiltonian submanifolds of regular polytopes

Cites work

• scientific article; zbMATH DE number 3804333 (Why is no real title available?)
• A proof of the lower bound conjecture for convex polytopes
• Hamiltonian circuits in certain prisms
• On Hamiltonian Circuits

Cited in

(9)

• Lower bound theorems for general polytopes
• Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes
• Polyhedra with few 3-cuts are Hamiltonian
• scientific article; zbMATH DE number 3849282 (Why is no real title available?)
• scientific article; zbMATH DE number 3843793 (Why is no real title available?)
• Are all simple 4-polytopes Hamiltonian?
• Hamiltonian tournaments and Gorenstein rings
• A property of graphs of convex polytopes
• On hamiltonian triangulations in simple polygons (Extended Abstract)

This page was built for publication: Hamiltonian simple polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900969)