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 C
m
of each length m for 
such that V(C
3)⊂V(C
4)⊂⋯⊂V(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].
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Final version received: June 9, 2003
Rights and permissions
About this article
Cite this article
Guo, Y., Volkmann, L. Extendable Cycles in Multipartite Tournaments. Graphs and Combinatorics 20, 185–190 (2004). https://doi.org/10.1007/s00373-003-0548-6
Received:
Issue Date:
DOI: https://doi.org/10.1007/s00373-003-0548-6