Weakly quasi-Hamiltonian-connected multipartite tournaments

In this paper, we characterize all weakly quasi-Hamiltonian-connected multipartite tournaments-i.e., for every pair of vertices, there is at least one quasi-Hamiltonian path between them. Our results include and extend corresponding ones concerning tournaments due to Thomassen.