Gyárfás, A., Ruszinkó, M., Sárközy, G. N., & Szemerédi, E. (2011). Partitioning $3$-Colored Complete Graphs into Three Monochromatic Cycles. The Electronic Journal of Combinatorics, 18(1), P53. https://doi.org/10.37236/540