Hamiltonian decomposition of Cayley graphs of orders \(p^2\) and \(pq\) (Q1568238)

A Hamiltonian decomposition of a graph is a decomposition of its edge set into (pairwise disjoint) Hamiltonian cycles. In this paper, the authors prove that every connected Cayley graph on an abelian group of order \(pq\) or \(p^2\) has a Hamiltonian decomposition, if \(p\) and \(q\) are odd prime numbers. This result answers partially a conjecture of Alspach concerning Hamiltonian decompositions of \(2k\)-regular Cayley graphs on abelian groups.