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

DOI10.1016/0012-365X(89)90166-0zbMath0691.90025MaRDI QIDQ583084

Stephen C. Locke, Dave Witte Morris

Publication date: 1989

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian cyclesflowcirculant graph

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items

Automorphisms of endomorphism semigroups of reflexive digraphs ⋮ Flows that are sums of Hamiltonian cycles in Cayley graphs on abelian groups

Cites Work

• The Hamilton spaces of Cayley graphs on abelian groups
• Pontryagin Duality in K-Theory
• Unnamed Item
• Unnamed Item