1. Brualdi, R.A., Li, Q.: The interchange graph of tournaments with the same score vector. In: Bondy, J.A., Murty, U.S.R., (eds.), Progress in Graph Theory. (Academic Press, Toronto, 1984) pp. 128–151
2. Chartrand, G., Zhang, P.: Introduction to Graph Theory. McGraw-Hill, Boston (2005)
3. Gibson, P.M.: A bound for the number of tournaments with specified scores. J. Comb. Theory, Ser. B 36, 240–243 (1984)
4. Harary, F., Moser, L.: The theory of round robin tournaments. Amer. Math. Monthly 73, 231–246 (1966)
5. Kannan, R., Tetali, P., Vempala, S.: Simple Markov-chain algorithms for generating bipartite graphs and tournaments. Random Struct. Algorithms 14, 293–308 (1999)