𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hamilton cycles in regular graphs

✍ Scribed by Bill Jackson

Publisher
John Wiley and Sons
Year
1978
Tongue
English
Weight
135 KB
Volume
2
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

UNIVERSIW OF WATERLOO

' The research reported here has been sponsored by the Canadian Commonwealth Association.

πŸ“œ SIMILAR VOLUMES

Generating and Counting Hamilton Cycles
Generating and Counting Hamilton Cycles in Random Regular Graphs
✍ Alan Frieze; Mark Jerrum; Michael Molloy; Robert Robinson; Nicholas Wormald πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 216 KB

Let G be chosen uniformly at random from the set G G r, n of r-regular graphs w x Ε½ . with vertex set n . We describe polynomial time algorithms that whp i find a Ε½ . Hamilton cycle in G, and ii approximately count the number of Hamilton cycles in G.

Edge disjoint Hamilton cycles in graphs
Edge disjoint Hamilton cycles in graphs
✍ Guojun Li πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 125 KB πŸ‘ 2 views
Hamilton cycles in claw-free graphs
Hamilton cycles in claw-free graphs
✍ Cun-Quan Zhang πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 299 KB πŸ‘ 2 views
Uniqueness of maximal dominating cycles
Uniqueness of maximal dominating cycles in 3-regular graphs and of hamiltonian cycles in 4-regular graphs
✍ Herbert Fleischner πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 461 KB πŸ‘ 2 views

## Abstract We construct 3‐regular (cubic) graphs __G__ that have a dominating cycle __C__ such that no other cycle __C__~1~ of __G__ satisfies __V(C)__ βŠ† __V__(__C__~1~). By a similar construction we obtain loopless 4‐regular graphs having precisely one hamiltonian cycle. The basis for these const