Weakly quasi-Hamiltonian-set-connected multipartite tournaments

Authors:
Yubao Guo;Mei Lu;Michel Surmacs
Affiliations:
Lehrstuhl C für Mathematik, RWTH Aachen University, 52056 Aachen, Germany;Department of Mathematical Sciences, Tsinghua University, Beijing 100084, China;Lehrstuhl C für Mathematik, RWTH Aachen University, 52056 Aachen, Germany
Venue:
Discrete Applied Mathematics
Year:
2012

Citing 2
Cited 1

Cycles in multipartite tournaments

Journal of Combinatorial Theory Series B
Vertex deletion and cycles in multipartite tournaments

Discrete Mathematics

Quasi-hamiltonian paths in semicomplete multipartite digraphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

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 to y 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].