𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hamiltonian cycles in Dirac graphs

✍ Scribed by Bill Cuckler; Jeff Kahn

Publisher
Springer-Verlag
Year
2009
Tongue
English
Weight
606 KB
Volume
29
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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).

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