Abstract
In this paper we prove that if T is a regular n-partite tournament with n≥6, then each arc of T lies on a k-cycle for k=4,5,...,n. Our result generalizes theorems due to Alspach[1] and Guo[3] respectively.
Similar content being viewed by others
References
Alspach, B. Cycles of each length in regular tournaments. Canad. Math. Bull., 10: 283–286 (1967)
Bondy, J.A., Murty, U.S.R. Graph theory with applications. MacMillan Press, New York (1976)
Guo, Y. Outpaths in semicomplete multipartite digraphs. Discrete Applied Math., 95: 273–277 (1999)
Guo, Y., Volkmann, L. Cycles in multipartite tournaments. J. Combin. Theory (Seirs B), 62: 363–366 (1994)
Volkmann L. Cycles in multipartite tournaments: results and problems. Discrete Math., 245: 19–53 (2002)
Yeo, A. Diregular c-partite tournaments are vertex-pancyclic when c ≥ 5. J. Graph Theory, 32: 137–152 (1999)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhou, Gf., Zhang, Km. Cycles Containing a Given Arc in Regular Multipartite Tournaments. Acta Mathematicae Applicatae Sinica, English Series 18, 681–684 (2002). https://doi.org/10.1007/s102550200071
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s102550200071