Sufficient conditions for semicomplete multipartite digraphs to be Hamiltonian (Q1970581)

A semicomplete multipartite digraph is obtained by replacing each edge of a complete multipartite graph by an arc or by a pair of mutually opposite arcs. While in 1984 the reviewer characterized Hamiltonian semicomplete bipartite digraphs, no such characterization is known for semicomplete multipartite digraphs. The authors prove an interesting sufficient condition for Hamiltonicity of semicomplete multipartite digraphs.