Weakly quasi-Hamiltonian-set-connected multipartite tournaments

被引：6

作者：

Guo, Yubao ^{[1
]}

Lu, Mei ^{[2
]}

Surmacs, Michel ^{[1
]}

机构：

[1] Rhein Westfal TH Aachen, Lehrstuhl Math C, D-52056 Aachen, Germany

[2] Tsinghua Univ, Dept Math Sci, Beijing 100084, Peoples R China

来源：

DISCRETE APPLIED MATHEMATICS | 2012年 / 160卷 / 10-11期

关键词：

Multipartite tournament; Quasi-Hamiltonian-connectivity; Weak quasi-Hamiltonian-set-connectivity;

D O I：

10.1016/j.dam.2012.02.012

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

A multipartite or c-partite tournament is an orientation of a complete c-partite graph. Lu and Guo (submitted for publication) [3] recently introduced strong quasi-Hamiltonian-connectivity of a multipartite tournament D as follows: For any two distinct vertices x and y of D, there is a path with at least one vertex from each partite set of D from x toy and from y to x. 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) [6]. (C) 2012 Elsevier B.V. All rights reserved.

引用

页码：1561 / 1566

页数：6