Complementary cycles in regular multipartite tournaments, where one cycle has length five |
| |
| Authors: | Zhihong He Stefan Winzen |
| |
| Institution: | a School of Mathematics and Information Science, Yantai University, Yantai 264005, China
b Lehrstuhl II für Mathematik, RWTH Aachen University, 52056 Aachen, Germany |
| |
| 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.In 1999, 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. |
| |
| Keywords: | Multipartite tournaments Complementary cycles Regular multipartite tournaments |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
