A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf
.
A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian
1996
Discrete Mathematics
A multipartite tournament is an orientation of a complete k-partite graph for some k ≥ 2. A factor of a digraph D is a collection of vertex disjoint cycles covering all the vertices of D. We show that there is no degree of strong connectivity which together with the existence of a factor will guarantee that a multipartite tournament is Hamiltonian. Our main result is a sufficient condition for a multipartite tournament to be Hamiltonian. We show that this condition is general enough to provide
doi:10.1016/0012-365x(95)00272-x
fatcat:cqhpnnleyjg7ll3w75foe4mvrm