The following publications are possibly variants of this publication:
- Partitioning 2-edge-colored graphs by monochromatic paths and cyclesJózsef Balogh, János Barát, Dániel Gerbner, András Gyárfás, Gábor N. Sárközy. combinatorica, 34(5):507-526, 2014. [doi]
- Monochromatic cycle partitions of edge-colored graphsGábor N. Sárközy. jgt, 66(1):57-64, 2011. [doi]
- An improved bound for the monochromatic cycle partition numberAndrás Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi. JCT, 96(6):855-873, 2006. [doi]