Some equitably 3-colourable cycle decompositions of complete equipartite graphs (Q2566144)

An \(m\)-cycle is equitably \(k\)-coloured if its vertices have been assigned colours so that the number of occurrences of each colour is \(\lceil \frac{m}{k} \rceil\) or \(\lfloor \frac{m}{k} \rfloor\). A decomposition of a graph \(G\) into cycles of length \(m\) is equitably \(k\)-coloured when every cycle in the decomposition is equitably \(k\)-coloured. In this paper, the conditions for a decomposition of the complete multipartite graph with all parts of the same size into cycles of length \(m\) = 3, 4, or 5 to be equitably 3-coloured are determined completely.