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

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

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

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free