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