Generalizations of tournaments: A survey

Authors:
Jørgen Bang–Jensen;Gregory Gutin
Affiliations:
Department of Mathematics and Computer Science, Odense University, Denmark;Dept. of Maths and Stats, Brunel University, Uxbridge, Middlesex UB8 3PH, U.K.
Venue:
Journal of Graph Theory
Year:
1998

Citing 0
Cited 6

Cycles in multipartite tournaments: results and problems

Discrete Mathematics
Orientations of digraphs almost preserving diameter

Discrete Applied Mathematics
Minimum Cost Homomorphism Dichotomy for Locally In-Semicomplete Digraphs

COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
On the complexity of kings

Theoretical Computer Science
On the complexity of kings

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Quasi-hamiltonian paths in semicomplete multipartite digraphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We survey results concerning various generalizations of tournaments. The reader will see that tournaments are by no means the only class of directed graphs with a very rich structure. We describe, among numerous other topics mostly related to paths and cycles, results on hamiltonian paths and cycles. The reader will see that although these problems are polynomially solvable for all of the classes described, they can be highly nontrivial, even for these “tournament-like” digraphs. © 1998 John Wiley & Sons, Inc. J. Graph Theory 28: 171–202, 1998