✦ LIBER ✦

Are all simple 4-polytopes Hamiltonian?

✍ Scribed by Moshe Rosenfeld

Book ID: 112886117
Publisher: The Hebrew University Magnes Press
Year: 1983
Tongue: English
Weight: 361 KB
Volume: 46
Category: Article
ISSN: 0021-2172
DOI: 10.1007/bf02761949

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian simple polytopes

✍ N. Prabhu 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 177 KB

Non-Hamiltonian simple 3-polytopes whose

Non-Hamiltonian simple 3-polytopes whose faces are all 5-gons or 7-gons

✍ P.J. Owens 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 170 KB

Let G3(p, q) denote the class of all simple 3-polytopes (or, equivalently, 3-connected 3-valent planar graphs) with only two types of face, p-gons and q-gons. For any graph G, let u(G) denote the number of vertices and h(G) the length of a maximum cycle. Non-Hamiltonian members of G3(5, q) are known

Non-Hamiltonian simple 3-polytopes whose

Non-Hamiltonian simple 3-polytopes whose faces are all 5-gons or 7-gons

✍ P.J. Owens 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 308 KB

Hamiltonian circuits on simple 3-polytop

Hamiltonian circuits on simple 3-polytopes

✍ Jean W Butler 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 291 KB

Hamiltonian Circuits on Simple 3-Polytop

Hamiltonian Circuits on Simple 3-Polytopes

✍ Goodey, P. R. 📂 Article 📅 1972 🏛 Oxford University Press 🌐 English ⚖ 152 KB

Desperately Seeking the Elusive, Non-Ham

Desperately Seeking the Elusive, Non-Hamiltonian Simple 4-Polytope

✍ MOSHE ROSENFELD 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 238 KB