Complementary cycles in regular multipartite tournaments, where one cycle has length five

The vertex set of a digraph DD is denoted by V(D)V(D). A cc-partite tournament is an orientation of a complete cc-partite graph.In 1999, Yeo conjectured that each regular cc-partite tournament DD with c≥4c≥4 and |V(D)|≥10|V(D)|≥10 contains a pair of vertex disjoint directed cycles of lengths 5 and |V(D)|−5|V(D)|−5. In this paper we shall confirm this conjecture using a computer program for some cases.