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

DOI10.1016/0012-365X(89)90166-0zbMATH Open0691.90025MaRDI QIDQ583084FDOQ583084

Authors: S. C. Locke, David Witte Morris 

Publication date: 1989

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

Recommendations

• Flows that are sums of Hamiltonian cycles in Cayley graphs on abelian groups
• Hamilton Cycles in Oriented Graphs
• \(k\)-Ordered Hamilton cycles in digraphs
• Hamilton cycles in (2, odd, 3)-Cayley graphs
• Hamilton cycles in circuit graphs of matroids
• scientific article; zbMATH DE number 4152419
• Hamilton cycles in circulant digraphs with prescribed number of distinct jumps
• A cycle structure theorem for Hamiltonian graphs
• scientific article; zbMATH DE number 568821
• Hamiltonian cycles in (2,3,c)-circulant digraphs

zbMATH Keywords

flowHamiltonian cyclescirculant graph

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The Hamilton spaces of Cayley graphs on abelian groups
• Pontryagin Duality in K-Theory

Cited In (4)

• Automorphisms of endomorphism semigroups of reflexive digraphs
• Odd Solutions to Systems of Inequalities Coming From Regular Chain Groups
• Flows that are sums of Hamiltonian cycles in Cayley graphs on abelian groups
• Title not available (Why is that?)

This page was built for publication: Flows in circulant graphs of odd order are sums of Hamilton cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q583084)