✦ LIBER ✦

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

✍ Scribed by Stephen C. Locke; Dave Witte

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 889 KB
Volume: 78
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90166-0

No coin nor oath required. For personal study only.

✦ Synopsis

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

📜 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