𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity of the hamiltonian cycle in regular graph problem

✍ Scribed by C. Picouleau


Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
491 KB
Volume
131
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Uniqueness of maximal dominating cycles
✍ 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

Independent Dominating Sets and a Second
✍ Carsten Thomassen πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 241 KB

In 1975, John Sheehan conjectured that every Hamiltonian 4-regular graph has a second Hamiltonian cycle. Combined with earlier results this would imply that every Hamiltonian r-regular graph (r 3) has a second Hamiltonian cycle. We shall verify this for r 300.