Abstract
Ann-partite tournament is an orientation of a completen-partite graph. In 1976, Bondy raised the following problem: does every strongn-partite (n⩾5) tournament, in which each partite set has at least two vertices, contain an (n+1)-cycle? It is the purpose of this paper to give a characterization of all suchn-partite tournaments without (n+1)-cycle.
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
