A Complete Directed Graph. A so-called Score Sequence can be associated with every tournament. Every tournament contains a Hamiltonian Path.

**References**

Chartrand, G. ``Tournaments.'' §27.2 in *Introductory Graph Theory.* New York: Dover, pp. 155-161, 1985.

Moon, J. W. *Topics on Tournaments.* New York: Holt, Rinehart, and Winston, 1968.

Ruskey, F. ``Information on Score Sequences.'' http://sue.csc.uvic.ca/~cos/inf/nump/ScoreSequence.html.

© 1996-9

1999-05-26