1. Andres, D., Lock, E.: Characterising and recognising game-perfect graphs. Discrete Math. Theoret. Comput. Sci. 21(1) (2019). https://dmtcs.episciences.org/5499
2. Lecture Notes in Computer Science;HL Bodlaender,1991
3. Bohman, T., Frieze, A., Sudakov, B.: The game chromatic number of random graphs. Random Struct. Algorithms 32(2), 223–235 (2008)
4. Charpentier, C., Hocquard, H., Sopena, E., Zhu, X.: A connected version of the graph coloring game. In: Proceedings of the 9th Slovenian International Conference on Graph Theory (Bled 2019) (2019). arXiv:1907.12276
5. Costa, E., Pessoa, V.L., Sampaio, R., Soares, R.: PSPACE-hardness of two graph coloring games. In: Electronic Notes in Theoretical Computer Science, vol. 346, pp. 333–344, Proceedings of the 10th Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2019 (2019)