References
- C. Berge, La fonction de Grundy d'un graphe infini., C.R. Acad. Sciences, Paris, 242(1956), 1404–1405.
- C. Berge and M.P. Schützenberger, Jeux de Nim et solutions, C.R. Acad. Sciences, Paris, 242 (1956), 1672.
- C. Berge, Theory of Graphs and its Applications, Methuen, London (1962).
- C. Berge, Graphs, North-Holland Mathematical Library, Vol.6 (1985).
- P. Duchet, Graphes Noyau-Parfaits, Annals of Discrete Mathematics, 9 (1980), 93–101.
- P. Duchet, A sufficient condition for a digraph to be kernel perfect, J. Graph Theory, II(1)(1987), 81–85.
- P. Duchet and H. Meyniel, A note on kernel-critical graphs, Discrete Math., 33 (1981), 103–105.
- A. Fraenkel and M. Lorberbom, Nimhoff games, J. Comb. Theory Ser. A, 58(1) (1991), 1–25.
- A. Fraenkel, Scenic trails ascending from sea-level Nim to alpine chess, Games of no chance (Berkeley, CA 1994), Math. Sci. Res. Inst. Publ., Cambridge Univ. Press, Cambridge, 29 (1996), 13–42.
- H. Galeana-Sánchez and V. Neumann-Lara, On kernels and semikernels of digraphs, Discrete Math., 48 (1984), 67–76.
- H. Galeana-Sánchez and V. Neumann-Lara, On the dichromatic number in kernel theory, Math. Slovaca, 48 (3) (1998), 213–219.
- P.M. Grundy, Mathematics and Games, Eureka, 2 (1939), 6–8.
- H. Landman, A simple FSM-based proof of the additive periodicity of the Sprague-Grundy function of Wythoff's game, More games of no chance (Berkeley, CA, 2000), Math. Sci. Res. Inst. Publ., Cambridge Univ. Press, Cambridge, 42 (2002), 383–386.
- J. Von Neumann, O. Morgenstern, Theory of games and economic behavior, Princeton University Press, Princeton, (1944).
- M. Richardson, Solutions of irreflexive relations, Ann. Math., 58(2) 1953), 573–580.