Vertex‐Transitive Graphs of Prime‐Squared Order Are Hamilton‐Decomposable

DOI10.1002/jcd.21381zbMath1285.05085OpenAlexW1501294690MaRDI QIDQ5406955

Darryn E. Bryant, Brian Alspach, Donald L. Kreher

Publication date: 4 April 2014

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.21381

zbMATH Keywords

Cayley graphvertex-transitive graphHamilton cycleHamilton decomposition

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

On Hamilton decompositions of infinite circulant graphs ⋮ Vertex-transitive graphs that have no Hamilton decomposition

Cites Work

• 6-regular Cayley graphs on abelian groups of odd order are Hamiltonian decomposable
• Hamiltonian decomposition of Cayley graphs of degree 4
• Hamiltonian decompositions of Cayley graphs on Abelian groups
• Hamiltonian decompositions of Cayley graphs on abelian groups of even order
• Hamiltonian decompositions of Cayley graphs on abelian groups of odd order
• Hamilton cycle decomposition of 6-regular circulants of odd order

This page was built for publication: Vertex‐Transitive Graphs of Prime‐Squared Order Are Hamilton‐Decomposable