Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs

A semicomplete multipartite or semicomplete c -partite digraph D is a biorientation of a c -partite graph. A semicomplete multipartite digraph D is called strongly quasi-Hamiltonian-connected, if for any two distinct vertices x and y of D , there is a path P from x to y such that P contains at least one vertex from each partite set of D . s paper we show that every 4-strong semicomplete multipartite digraph is strongly quasi-Hamiltonian-connected. This generalizes a result due to Thomassen for tournaments.