✦ LIBER ✦

Hamiltonian paths on 3-polytopes

✍ Scribed by P.R Goodey

Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 522 KB
Volume: 12
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(72)90018-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian circuits on simple 3-polytop

Hamiltonian circuits on simple 3-polytopes

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

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

Note on two problems of J. Zaks concerni

Note on two problems of J. Zaks concerning Hamiltonian 3-polytopes

✍ Hansjoachim Walther 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 313 KB

Let us denote by G(m, n) the family of all simple 3-poiytopes having ,just two types of faces, m-gons and n-gons. J. Z&s [3] proved that G(5; k) contains non-Hamiltonian members for all k, k 3 11, and asked among others the folfowing question: Do there exist non-Hamiltonian members in any of the fam

A class of Hamiltonian polytopes

✍ P. R. Goodey 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 208 KB

## Abstract It is shown that any simple 3‐polytope, all of whose faces are triangles or hexagons, admits a hamiltonian circuit.

Hamiltonian Square-Paths

✍ Genghua Fan; H.A Kierstead 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 425 KB

A hamiltonian square-path (-cycle) is one obtained from a hamiltonian path (cycle) by joining every pair of vertices of distance two in the path (cycle). Let G be a graph on n vertices with minimum degree $(G). Posa and Seymour conjectured that if $(G) 2 3 n, then G contains a hamiltonian square-cy