We show any flow in any connected circulant graph of odd order can be expressed as a sum of Hamilton cycles. © 1989.
Locke, S. C., & Witte, D. (1989). Flows in circulant graphs of odd order are sums of Hamilton cycles. Discrete Mathematics, 78(1–2), 105–114. https://doi.org/10.1016/0012-365X(89)90166-0