Weakly quasi-Hamiltonian-set-connected multipartite tournaments

详细信息    查看全文

• 作者：Yubao Guo^a ; ^{guo@mathc.rwth-aachen.de} ; Mei Lu^b ; ^{mlu@math.tsinghua.edu.cn} ; Michel Surmacs^a ; ^{michel.surmacs@rwth-aachen.de}
• 关键词：Multipartite tournament ; Quasi-Hamiltonian-connectivity ; Weak quasi-Hamiltonian-set-connectivity
• 刊名：Discrete Applied Mathematics
• 出版年：2012
• 出版时间：July, 2012
• 年：2012
• 卷：160
• 期：10-11
• 页码：1561-1566
• 全文大小：219 K

文摘

A multipartite or -partite tournament is an orientation of a complete -partite graph. Lu and Guo (submitted for publication)? recently introduced strong quasi-Hamiltonian-connectivity of a multipartite tournament as follows: For any two distinct vertices and of , there is a path with at least one vertex from each partite set of from to and from to . We obtain the definition for weak quasi-Hamiltonian-connectivity, where only one of those paths, and weak quasi-Hamiltonian-set-connectivity, where only one such path between every two distinct partite sets has to exist, in a natural way.

In this paper, we characterize weakly quasi-Hamiltonian-set-connected multipartite tournaments which extends a result of Thomassen (1980)?.