On Hamilton cycle decomposition of 6-regular circulant graphs

DOI10.1007/s00373-006-0657-0zbMath1108.05057OpenAlexW2003567067MaRDI QIDQ855297

Matthew Dean

Publication date: 5 January 2007

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-006-0657-0

Mathematics Subject Classification ID

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

On bipartite 2-factorizations of kn − I and the Oberwolfach problem, On Hamilton decompositions of infinite circulant graphs, Hamilton decompositions of 6-regular Cayley graphs on even abelian groups with involution-free connections sets, On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors, Hamilton decompositions of certain 6-regular Cayley graphs on abelian groups with a cyclic subgroup of index two, Bipartite 2‐Factorizations of Complete Multipartite Graphs, Vertex-transitive graphs that have no Hamilton decomposition, A family of efficient six-regular circulants representable as a Kronecker product

Cites Work

• 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
• Pseudo-Cartesian products and Hamiltonian decompositions of Cayley graphs on abelian groups
• Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey