Extendable Cycles in Multipartite Tournaments |
| |
| Authors: | Yubao?Guo Email author" target="_blank">Lutz?VolkmannEmail author |
| |
| Institution: | (1) Lehrstuhl C für Mathematik, RWTH Aachen, 52056 Aachen, Germany;(2) Lehrstuhl C für Mathematik, RWTH Aachen, 52056 Aachen, Germany |
| |
| Abstract: | An n-partite tournament is an orientation of a complete n-partite graph. If D is a strongly connected n-partite (n 3) tournament, then we shall prove that every partite set of D has at least one vertex which lies on a cycle Cm of each length m for  such that V(C3) V(C4) V(Cn), where V(Cm) is the vertex set of Cm for . This result extends those of Bondy 2], Guo and Volkmann 4], Gutin 6], Moon 8], and Yeo 12].Final version received: June 9, 2003 |
| |
| Keywords: | Multipartite tournaments Cycles Extendable cycles |
| 本文献已被 SpringerLink 等数据库收录！ |
|
