1.
Gyárfás A, Ruszinkó M, Sárközy GN, Szemerédi E. Partitioning $3$-Colored Complete Graphs into Three Monochromatic Cycles. Electron. J. Combin. [Internet]. 2011Mar.11 [cited 2026Mar.29];18(1):P53. Available from: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v18i1p53