Hamiltonian simple polytopes

DOI10.1007/BF02570708zbMATH Open0838.52012MaRDI QIDQ1900969FDOQ1900969

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

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

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)

Cites Work

• Title not available (Why is that?)
• A proof of the lower bound conjecture for convex polytopes
• On Hamiltonian Circuits
• Hamiltonian circuits in certain prisms

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
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)