科研之友
微信
新浪微博
Facebook
分享链接
摘要
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 toy 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.
- 出版日期2013-12-6
- 单位清华大学
