| LC control no. | sh 97007070 |
|---|---|
| Topical heading | Tournaments (Graph theory) |
| Variant(s) | Round-robin tournaments (Graph theory) T-graphs Tournaments, Round-robin (Graph theory) |
| See also | Directed graphs |
| Found in | Work cat.: 97-31683: Cherlin, G.L. The classification of countable homogeneous directed graphs and countable homogeneous n-tournaments, 1998. Math. subj. classif. (05-XX, Combinatorics; 05Cxx, Graph theory; 05C20, Directed graphs (digraphs), tournaments) Encyc. math. (Tournament: an oriented graph without loops, each pair of vertices of which is joined by an arc in exactly one direction; the notion of a tournament is used for ordering n objects by the method of pairwise comparison (round-robin tournament)) Eisenreich. Mathematik (tournament; T-graph, round-robin tournament; <graph theory>) |
 |  |  |