✦ LIBER ✦

Hamiltonian circuits on simple 3-polytopes

✍ Scribed by Jean W Butler

Publisher: Elsevier Science
Year: 1973
Tongue: English
Weight: 291 KB
Volume: 15
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(73)90032-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian paths on 3-polytopes

✍ P.R Goodey 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 522 KB

Every simple 3-polytope of order 32 or l

Every simple 3-polytope of order 32 or less is Hamiltonian

✍ Haruko Okamura 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 313 KB

## Abstract Using theorems of Butler, Goodey, and Okamura we show that every simple 3‐polytope of order 32 or less is Hamiltonian.

On a class of Hamiltonian polytopes

✍ Stanislav Jendrol̆; Peter Mihók 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 652 KB

On Pedigree Polytopes and Hamiltonian Cy

On Pedigree Polytopes and Hamiltonian Cycles

✍ Tim S. Arthanari 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 175 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 ⚖ 308 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