## Abstract It is shown that any simple 3‐polytope, all of whose faces are triangles or hexagons, admits a hamiltonian circuit.
On a class of Hamiltonian polytopes
✍ Scribed by Stanislav Jendrol̆; Peter Mihók
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 652 KB
- Volume
- 71
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
Using the concept of brick-products, Alspach and Zhang showed in that all cubic Cayley graphs over dihedral groups are Hamiltonian. It is also conjectured that all brick-products C(2n, m, r) are Hamiltonian laceable, in the sense that any two vertices at odd distance apart can be joined by a Hamilt