1. Adams, P., Bryant, D., Khodkar, A.: Uniform $$3$$-factorisations of $$K_{10}$$, Proceedings of the Twenty-eighth Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 1997. Congr. Numer. 127, 23–32 (1997)
2. Adams, P., El-Zanati, S.I., Florido, P., Turner, W.: On $$2$$- and $$3$$-factorizations of complete $$3$$-uniform hypergraphs of order up to 9. Australas. J. Combin. 78, 100–113 (2020)
3. Alspach, B.: The wonderful Walecki construction. Bull. Inst. Combin. Appl. 52, 7–20 (2008)
4. Alspach, B., Bryant, D., Horsley, D., Maenhaut, B., Scharaschkin, V.: On factorisations of complete graphs into circulant graphs and the Oberwolfach problem. Ars Math. Contemp. 11, 157–173 (2016)
5. Anderson, L.D.: Factorizations of graphs. In: Colbourn, C.J., Dinitz, J.H. (eds.), The CRC Handbook of Combinatorial Designs, 2nd ed., pp. 740–754. CRC Press, Boca Raton (2007)