Factorizations of product graphs into cycles of uniform length (Q1805375)

The following problem is considered. If a graph \(G_ 1\) has a decomposition into hamiltonian cycles and a 1-factor, and \(G_ 2\) has a decomposition into hamiltonian cycles, does their wreath product \(G_ 1* G_ 2\) admit a hamiltonian cycle decomposition? The authors give some partial results. They consider also the Cartesian and the weak products as well as the decomposition into cycles of the same length.