S. D. Andres, M. Huggan, F. Mc-inerney, and R. Nowakowski, The orthogonal colouring game, INRIA, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02017462

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.

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

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

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

R. Diestel, Graph Theory, 2017.

C. H. Papadimitriou, Computational complexity, 1993.

T. J. Schaefer, The complexity of satisfiability problems, Proceedings of the tenth annual ACM symposium on Theory of computing, pp.216-226, 1978.

T. J. Schaefer, On the complexity of some two-person perfect-information games, J. Comput. Syst. Sci, vol.16, pp.185-225, 1978.