Author/Authors :
He، نويسنده , , Zhihong and Korneffel، نويسنده , , Torsten and Meierling، نويسنده , , Dirk and Volkmann، نويسنده , , Lutz and Winzen، نويسنده , , Stefan، نويسنده ,
Abstract :
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.
9, Yeo conjectured that each regular c -partite tournament D with c ≥ 4 and | V ( D ) | ≥ 10 contains a pair of vertex disjoint directed cycles of lengths 5 and | V ( D ) | − 5 . In this paper we shall confirm this conjecture using a computer program for some cases.
