✦ LIBER ✦

Polyhedral graphs without hamiltonian cycles

✍ Scribed by Hansjoachim Walther

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 309 KB
Volume: 79
Category: Article
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(97)00047-4

No coin nor oath required. For personal study only.

✦ Synopsis

There is a constructed sequence of polyhedral cyclically 5-connected cubic non-hamiltonian graphs having only 5-gons and 8-gons as faces.

📜 SIMILAR VOLUMES

Small cycles in Hamiltonian graphs

✍ Uwe Schelten; Ingo Schiermeyer 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 733 KB

We prove that if a graph G on n > 32 vertices is hamiltonian and has two nonadjacent vertices u and u with d(u) + d(u) 3 n + z where z = 0 if n is odd and z = 1 if n is even, then G contains all cycles of length m where 3 < m < 1/5(n + 13).

Graphs without four-cycles

✍ C. R. J. Clapham; A. Flockhart; J. Sheehan 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 722 KB

We investigate the values of t(n), the maximum number of edges in a graph with n vertices and not containing a four-cycle. Techniques for finding these are developed and the values of t(n) for all n up to 21 are obtained. All the corresponding extremal graphs are found.

Hamiltonian cycles in n-extendable graph

Hamiltonian cycles in n-extendable graphs

✍ Ken-ichi Kawarabayashi; Katsuhiro Ota; Akira Saito 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 88 KB

## Abstract A graph __G__ of order at least 2__n__+2 is said to be __n__‐extendable if __G__ has a perfect matching and every set of __n__ independent edges extends to a perfect matching in __G__. We prove that every pair of nonadjacent vertices __x__ and __y__ in a connected __n__‐extendable graph

Hamiltonian cycles in cayley color graph

Hamiltonian cycles in cayley color graphs

✍ Joseph B. Klerlein 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 165 KB 👁 1 views

## Abstract A group Γ is said to possess a hamiltonian generating set if there exists a minimal generating set Δ for Γ such that the Cayley color graph __D__~Δ~(Γ) is hamiltonian. It is shown that every finite abelian group has a hamiltonian generating set. Certain classes of nonabelian groups are

Thin Hamiltonian cycles on Archimedean g

Thin Hamiltonian cycles on Archimedean graphs

✍ John R Reay; D.G Rogers 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 200 KB

Hamiltonian cycles in random regular gra

Hamiltonian cycles in random regular graphs

✍ T.I Fenner; A.M Frieze 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 484 KB