Abstract
An n-partite tournament is an orientation of a complete n-partite graph. We show that if D is a strongly connected n-partite ( n ≥ 3) tournament, then every partite set of D has at least one vertex, which lies on an m-cycle for all m in {3, 4,..., n}. This result extends those of Bondy ( J. London Math. Soc. 14 (1976), 277-282) and Gutin ( J. Combin. Theory Ser. B 58 (1993), 319-321).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
