Partitioning 3-colored complete graphs into three monochromatic cycles.
Gyárfás, András ; Ruszinkó, Miklós ; Sarközy, Gábor N. ; Szemerédi, Endre
The Electronic Journal of Combinatorics [electronic only], Tome 18 (2011), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2011-01-01
EUDML-ID : urn:eudml:doc:231887 
@article{05902983,
     title = {Partitioning 3-colored complete graphs into three monochromatic cycles.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {18},
     year = {2011},
     zbl = {1217.05185},
     language = {en},
     url = {http://dml.mathdoc.fr/item/05902983}
}

Gyárfás, András; Ruszinkó, Miklós; Sarközy, Gábor N.; Szemerédi, Endre. Partitioning 3-colored complete graphs into three monochromatic cycles.. The Electronic Journal of Combinatorics [electronic only], Tome 18 (2011) . http://gdmltest.u-ga.fr/item/05902983/