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 tournament, and if v is the only vertex in one of the partite sets of D, then for any m, 3 ≤ m ≤ n, there is an m-cycle of D containing v. This generalizes a theorem of Moon.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
