𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Thin Hamiltonian cycles on Archimedean graphs

✍ Scribed by John R Reay; D.G Rogers

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
200 KB
Volume
16
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On certain Hamiltonian cycles in planar
On certain Hamiltonian cycles in planar graphs
✍ BοΏ½hme, T.; Harant, J.; TkοΏ½?, M. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 162 KB πŸ‘ 2 views

The problem is considered under which conditions a 4-connected planar or projective planar graph has a Hamiltonian cycle containing certain prescribed edges and missing certain forbidden edges. The results are applied to obtain novel lower bounds on the number of distinct Hamiltonian cycles that mus

Small cycles in Hamiltonian graphs
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).

Polyhedral graphs without hamiltonian cy
Polyhedral graphs without hamiltonian cycles
✍ Hansjoachim Walther πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 309 KB

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

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