Partitioning 2-edge-coloured bipartite graphs into monochromatic cycles

Fabrício Siqueira Benevides, Arthur Lima Quintino, Alexandre Talon

Given an $r$-edge-colouring of the edges of a graph $G$, we say that it can be partitioned into $p$ monochromatic cycles when there exists a set of $p$ vertex-disjoint monochromati…