✦ LIBER ✦

On Hamilton Cycle Decomposition of 6-regular Circulant Graphs

✍ Scribed by Matthew Dean

Publisher: Springer Japan
Year: 2006
Tongue: English
Weight: 177 KB
Volume: 22
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-006-0657-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamilton cycle decomposition of 6-regula

Hamilton cycle decomposition of 6-regular circulants of odd order

✍ Matthew Dean 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 119 KB

## 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

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

Symmetric Hamilton cycle decompositions

Symmetric Hamilton cycle decompositions of the complete graph

✍ Jin Akiyama; Midori Kobayashi; Gisaku Nakamura 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 95 KB 👁 1 views

Decompositions of complete graphs into t

Decompositions of complete graphs into triangles and Hamilton cycles

✍ Darryn Bryant; Barbara Maenhaut 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB 👁 1 views

## Abstract For all odd integers __n__ ≥ 1, let __G~n~__ denote the complete graph of order __n__, and for all even integers __n__ ≥ 2 let __G~n~__ denote the complete graph of order __n__ with the edges of a 1‐factor removed. It is shown that for all non‐negative integers __h__ and __t__ and all p

On Hamilton-cycles of random graphs

✍ I. Palásti 📂 Article 📅 1971 🏛 Springer Netherlands 🌐 English ⚖ 243 KB

Hamilton Cycle Decomposition of Line Gra

Hamilton Cycle Decomposition of Line Graphs and a Conjecture of Bermond

✍ A. Muthusamy; P. Paulraja 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 614 KB

In this paper it is proved that if a graph $G$ has a decomposition into an even (resp., odd) number of Hamilton cycles, then $L(G)$, the line graph of $G$, has a decomposition into Hamilton cycles (resp., Hamilton cycles and a 2-factor). Further, we show that if $G$ is a $2 k$-regular grap