Bang-Jensen, J. and Gutin, Gregory (1998) Generalizations of tournaments: A survey. Journal of Graph Theory, 28 (4).
Full text access: Open
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
This is a Submitted version This version's date is: 1998 This item is not peer reviewed
https://repository.royalholloway.ac.uk/items/a7968415-bac2-8cd7-ace3-92ca8dbacc18/6/
Deposited by Research Information System (atira) on 03-Jul-2014 in Royal Holloway Research Online.Last modified on 03-Jul-2014