Are all simple 4-polytopes Hamiltonian?

DOI10.1007/BF02761949zbMath0538.05045MaRDI QIDQ793051

Moshe Rosenfeld

Publication date: 1983

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian circuit4-polytope

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Polytopes and polyhedra (52Bxx)

Related Items (1)

On 3‐polytopes with non‐Hamiltonian prisms

Cites Work

• Unnamed Item
• Unnamed Item
• Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
• Hamiltonian circuits in certain prisms
• Cyclability of r-regular r-connected graphs
• Polytopes, graphs, and complexes

This page was built for publication: Are all simple 4-polytopes Hamiltonian?