M. H. Albert, R. J. Nowakowski, and D. Wolfe, Lessons in Play, 2007.

S. D. Andres, F. Dross, M. Huggan, F. Mc-inerney, and R. Nowakowski, On the complexity of orthogonal colouring games and the NP-completeness of recognising graphs admitting a strictly matched involution, INRIA, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02053265

D. Archdeacon, J. Dinitz, and F. Harary, Orthogonal edge colorings of graphs, Proceedings of the Sixteenth Southeastern International Conference on Combinatorics, Graph Theory and Computing, vol.47, pp.49-67, 1985.

S. C. Ballif, Upper bounds on sets of orthogonal colorings of graphs, Discrete Math, vol.313, pp.2195-2205, 2013.

T. Bartnicki, J. Grytczuk, H. A. Kierstead, and X. Zhu, The map-coloring game, Amer. Math. Monthly, vol.114, pp.793-803, 2007.

L. Beaudou, E. Duchêne, and S. Gravier, A survey of solitaire clobber, Games of No Chance, pp.13-40, 2015.

G. Beaulieu, K. Burke, and E. Duchêne, Impartial coloring games, Theoret. Comput. Sci, vol.485, pp.49-60, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01339160

R. A. Beeler, Tic-tac-toe on graphs, Australas. J. Combin, vol.72, issue.1, pp.106-112, 2018.

E. Berlekamp, J. H. Conway, and R. K. Guy, Winning ways for your mathematical plays, A. K. Peters Ltd, vol.1, 2001.

H. L. Bodlaender, On the complexity of some coloring games, Internat. J. Found. Comput. Sci, vol.2, pp.133-147, 1991.

R. Brualdi, Introductory Combinatorics. Pearson Education Ltd, 2010.

Y. Caro and R. Yuster, Orthogonal colorings of graphs, Electron. J. Combin, vol.6, issue.1, p.14, 1999.

C. Dunn, V. Larsen, and J. F. Nordstrom, Introduction to competitive graph coloring, A Primer for Undergraduate Research, pp.99-126, 2017.

U. Faigle, W. Kern, H. Kierstead, and W. T. Trotter, On the game chromatic number of some classes of graphs, Ars Combin, vol.35, pp.143-150, 1993.

S. Faridi, S. Huntemann, and R. J. Nowakowski, Simplicial complexes are game complexes. to appear in Elect, J. Combinatorics, 2019.

A. S. Fraenkel, Combinatorial games: selected bibliography with a succinct gourmet introduction, Electron. J. Combin, p.48, 2000.

M. Gardner, Mathematical games, Scientific American, vol.244, pp.23-26, 1981.

C. D. Godsil and G. Royle, Algebraic graph theory, Graduate Text in Mathematics, vol.207, 2001.

D. J. Guan and X. Zhu, Game chromatic number of outerplanar graphs, J. Graph Theory, vol.30, issue.1, pp.67-70, 1999.

F. Harary and Z. Tuza, Two graph-colouring games, Bull. Austral. Math. Soc, vol.48, pp.141-149, 1993.

M. A. Henning and D. F. , Progress towards the total domination game 3/4-conjecture, Discrete Math, vol.339, pp.2620-2627, 2016.

U. Larsson, R. J. Nowakowski, J. P. Neto, and C. P. Santos, Guaranteed scoring games, Electron. J. Combin, vol.23, 2016.

U. Larsson, R. J. Nowakowski, and C. P. Santos, Game comparison through play, Theoret. Comput. Sci, vol.725, pp.52-63, 2018.

U. Larsson, R. J. Nowakowski, and C. P. Santos, Games with guaranteed scores and waiting moves, Internat. J. Game Theory, vol.47, pp.653-671, 2018.

U. Larsson, R. J. Nowakowski, and C. P. Santos, Scoring games: the state of play, Mathematical Sciences Research Publications, vol.70, issue.5, pp.89-111, 2019.

S. J. Seo and P. J. Slater, Competition parameters of a graph, AKCE Int. J. Graphs Comb, vol.4, issue.2, pp.183-190, 2007.

Z. Tuza and X. Zhu, Colouring games, Topics in chromatic graph theory, vol.156, pp.304-326, 2015.

X. Zhu, Refined activation strategy for the marking game, J. Comb. Theory Ser. B, vol.98, issue.1, pp.1-18, 2008.