共 50 条
Extendable cycles in multipartite tournaments
被引:6
作者:
Guo, YB
[1
]
Volkmann, L
机构:
[1] Rhein Westfal TH Aachen, Lehrstuhl Math C, D-52056 Aachen, Germany
[2] Rhein Westfal TH Aachen, Lehrstuhl Math 2, D-52056 Aachen, Germany
关键词:
multipartite tournaments;
cycles;
extendable cycles;
D O I:
10.1007/s00373-003-0548-6
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
An n-partite tournament is an orientation of a complete n-partite graph. If D is a strongly connected n-partite (ngreater than or equal to3) tournament, then we shall prove that every partite set of D has at least one vertex which lies on a cycle C-m of each length m for m is an element of {3,4,...n} such that V(C-3)subset ofV(C-4)subset of...subset ofV(C-n), where V(C-m) is the vertex set of C-m for . This result extends those of Bondy [2], Guo and Volkmann [4], Gutin [6], Moon [8], and Yeo [12].
引用
收藏
页码:185 / 190
页数:6
相关论文
共 50 条