Complementary Cycles in Regular Multipartite Tournaments, where One Cycle Has Length Four
Lutz Volkmann · RWTH Publications (RWTH Aachen) · 2004
The vertex set of a digraph D is denoted by V(D). A c-partite tournament is an orientation of a complete c-partite graph. In 1999, Yea conjectured that each regular c-partite tournament D with and contains a pair of vertex disjoint directed cycles of lengths 4 and . An example will demonstrate that Yeo's conjecture is not true in general for regular 4-partite tournaments with two vertices in each partite. However, in all other cases we shall confirm this conjecture in affirmative.