✦ LIBER ✦

Hamilton cycle decomposition of 6-regular circulants of odd order

✍ Scribed by Matthew Dean

Publisher: John Wiley and Sons
Year: 2007
Tongue: English
Weight: 119 KB
Volume: 15
Category: Article
ISSN: 1063-8539
DOI: 10.1002/jcd.20118

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

The circulant G = C(n,S), where $S\subseteq Z_n\setminus{0}$, is the graph with vertex set Z~n~ and edge set $E(G)= {{x,x+s}|x \in Z_n,s \in S}$. It is shown that for n odd, every 6‐regular connected circulant C(n, S) is decomposable into Hamilton cycles. © 2006 Wiley Periodicals, Inc. J Combin Designs

📜 SIMILAR VOLUMES

On Hamilton Cycle Decomposition of 6-reg

On Hamilton Cycle Decomposition of 6-regular Circulant Graphs

✍ Matthew Dean 📂 Article 📅 2006 🏛 Springer Japan 🌐 English ⚖ 177 KB

Flows in circulant graphs of odd order a

Flows in circulant graphs of odd order are sums of Hamilton cycles

✍ Stephen C. Locke; Dave Witte 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 889 KB

We show any flow in any connected circulant graph of odd order can be expressed as a sum of Hamilton cycles.

Random Matchings Which Induce Hamilton C

Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular Graphs

✍ Jeong Han Kim; Nicholas C. Wormald 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 215 KB

Select four perfect matchings of 2n vertices, independently at random. We find the asymptotic probability that each of the first and second matchings forms a Hamilton cycle with each of the third and fourth. This is generalised to embrace any fixed number of perfect matchings, where a prescribed set