Gyárfás, András, Miklós Ruszinkó, Gábor N. Sárközy, and Endre Szemerédi. “Partitioning $3$-Colored Complete Graphs into Three Monochromatic Cycles”. The Electronic Journal of Combinatorics 18, no. 1 (March 11, 2011): P53. Accessed March 29, 2026. https://www.combinatorics.org/ojs/index.php/eljc/article/view/v18i1p53.