GENERALIZATIONS OF TOURNAMENTS - A SURVEY

We survey results concerning various generalizations of tournaments. T he reader will see that tournaments are by no means the only class of directed graphs with a very rich structure. We describe, among numerou s other topics mostly related to paths and cycles, results on hamilton ian 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. (C) 1998 John Wiley & Sons, Inc.