Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles, Combinatorics, Probability and Computing, vol.260, issue.04, pp.471-486, 2008. ,
DOI : 10.1007/BF01196135
Vertex coverings by monochromatic cycles and trees, J. Combin. Theory Ser. B, pp.51-90, 1991. ,
Vertex coverings by monochromatic paths and cycles, Journal of Graph Theory, vol.203, issue.1, pp.131-135, 1983. ,
DOI : 10.1002/jgt.3190070116
An improved bound for the monochromatic cycle partition number, J. Combin. Theory Ser. B, pp.96-855, 2006. ,
Partitioning Complete Bipartite Graphs by Monochromatic Cycles, Journal of Combinatorial Theory, Series B, vol.69, issue.2, pp.210-218, 1997. ,
DOI : 10.1006/jctb.1997.1737
Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles, Combinatorics, Probability and Computing, vol.7, issue.4, pp.423-436, 1998. ,
DOI : 10.1017/S0963548398003599