Gyárfás, A., M. Ruszinkó, G. N. Sárközy, and E. Szemerédi. “Partitioning $3$-Colored Complete Graphs into Three Monochromatic Cycles”. The Electronic Journal of Combinatorics, Vol. 18, no. 1, Mar. 2011, p. P53, doi:10.37236/540.