Let n and k1, k2, . . . , kn be integers with n > 1 and ki≥2 for 1≤i≤n. We show that there exists a Cs-factorization of Πni=1 C2ki if and only if s = 2t with 2≤t≤k1 + ⋯ + kn. We also settle the problem of cycle factorizations of the d-cube. © 1998 Elsevier Science B.V. All rights reserved.
El-Zanati, S., & Vanden Eynden, C. (1998). Cycle factorizations of cycle products. Discrete Mathematics, 189(1–3), 267–275. https://doi.org/10.1016/S0012-365X(98)00053-3