References
- FarzadB.MahdianM.MahmoodianE.S.SaberiA.SadriB., Forced orientation of graphs Bull. Iranian Math. Soc. 32 1 2006 79–89
- BoeschFrankTindellRalph, Robbins’s theorem for mixed multigraphs Amer. Math. Monthly 87 9 1980 716–719
- Alex Schaefer, Balanced non-transitive dice, II. Tournaments, College Math J.,arXiv:1706.089086 (in press).
- MoonJohn W., Topics on Tournaments1968HoltRinehart and Winston, New York
- RobbinsH.E., A theorem on graphs, with an application to a problem of traffic control Amer. Math. Monthly 46 5 1939 281–283
- EswaranKapali P.TarjanRobert E., Augmentation problems SIAM J. Comput. 5 4 1976 653–665
- FrankAndrás, Augmenting graphs to meet edge-connectivity requirements SIAM J. Discrete Math. 5 1 1992 25–53
- FrankAndrásJordánTibor, Minimal edge-coverings of pairs of sets J. Combin. Theory Ser. B 65 1 1995 73–110
- FrankAndrásJordánTibor, Directed vertex-connectivity augmentation Connectivity augmentation of networks: structures and algorithms, (Budapest, 1994)Math. Program. 84B 3 1999 537–553
- GardnerMartin, The paradox of the nontransitive dice and the elusive principle of indifference Sci. Am. 223 12 1970 110–114
- GardnerMartin, On the paradoxical situations that arise from nontransitive relations Sci. Am. 231 10 1974 120–125
- GardnerMartin, Nontransitive dice and other paradoxes The Colossal Book of Mathematics: Classic Puzzles, Paradoxes, and Problems2001Norton, New York286–296Ch. 22
- Shirley Quimby, The Pallbearers Review (1971). (Cited in [12].).
- Savage JrRichard P., The paradox of nontransitive dice Amer. Math. Monthly 101 5 1994 429–436
- SchaeferAlexSchweigJay, Balanced non-transitive dice College Math. J. 48 1 2017 10–16