Paley graphs have Hamilton decompositions

DOI10.1016/j.disc.2011.06.003zbMath1232.05129OpenAlexW2049246407MaRDI QIDQ658027

Danny Dyer, Brian Alspach, Darryn E. Bryant

Publication date: 11 January 2012

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

Full work available at URL: https://doi.org/10.1016/j.disc.2011.06.003

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Eulerian and Hamiltonian graphs (05C45) Graph designs and isomorphic decomposition (05C51)

Related Items

2-spanning cyclability problems of some generalized Petersen graphs, Orthogonal projection and liftings of Hamilton-decomposable Cayley graphs on abelian groups, Hamilton decompositions of regular expanders: applications, Recent advances on the Hamiltonian problem: survey III, Disjoint cycles in hypercubes with prescribed vertices in each cycle, Edge-disjoint Hamilton cycles in random graphs

Cites Work

• Unnamed Item
• 6-regular Cayley graphs on abelian groups of odd order are Hamiltonian decomposable
• Hamiltonian decomposition of Cayley graphs of degree 4
• Décomposition de la somme cartesienne d'un cycle et de l'union de deux cycles hamiltoniens en cycles hamiltoniens
• Hamilton decompositions of Cartesian products of graphs
• Hamiltonian Decompositions of Graphs, Directed Graphs and Hypergraphs
• Transversals and matroid partition