Premium
Generalizations of tournaments: A survey
Author(s) -
Bang–Jensen Jørgen,
Gutin Gregory
Publication year - 1998
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199808)28:4<171::aid-jgt1>3.0.co;2-g
Subject(s) - tournament , mathematics , combinatorics , hamiltonian path , class (philosophy) , directed graph , graph , discrete mathematics , mathematical economics , computer science , artificial intelligence
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