Abstract
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.In this paper we show that every 4-strong semicomplete multipartite digraph is strongly quasi-Hamiltonian-connected. This generalizes a result due to Thomassen for tournaments.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
