T. Bartnicki, J. Grytczuk, H. A. Kierstead, and X. Zhu, The map colouring game, American Mathematics Monthly

H. L. Bodlaender, ON THE COMPLEXITY OF SOME COLORING GAMES, International Journal of Foundations of Computer Science, vol.02, issue.02, pp.133-147, 1991.
DOI : 10.1142/S0129054191000091

C. Dunn and H. A. Kierstead, A simple competitive graph coloring algorithm II, Journal of Combinatorial Theory, Series B, vol.90, issue.1, pp.93-106, 2004.
DOI : 10.1016/S0095-8956(03)00077-7

C. Dunn and H. A. Kierstead, A simple competitive graph coloring algorithm III, Journal of Combinatorial Theory, Series B, vol.92, issue.1, pp.137-150, 2004.
DOI : 10.1016/j.jctb.2004.03.010

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

M. Gardner, Mathematical games, Scientific American, 1981.
DOI : 10.1038/scientificamerican0157-138

D. J. Guan and X. Zhu, Game chromatic number of outerplanar graphs, Journal of Graph Theory, vol.18, issue.1, pp.67-70, 1999.
DOI : 10.1002/(SICI)1097-0118(199901)30:1<67::AID-JGT7>3.0.CO;2-M

W. He, X. Hou, K. Lih, J. Shao, W. Wang et al., Edge-partitions of planar graphs and their game coloring numbers, Journal of Graph Theory, vol.75, issue.4, pp.307-317, 2002.
DOI : 10.1002/jgt.10069

H. A. Kierstead, A Simple Competitive Graph Coloring Algorithm, Journal of Combinatorial Theory, Series B, vol.78, issue.1, pp.57-68, 2000.
DOI : 10.1006/jctb.1999.1927
URL : http://doi.org/10.1006/jctb.1999.1927

H. A. Kierstead and W. T. Trotter, Planar graph coloring with an uncooperative partner, Journal of Graph Theory, vol.27, issue.6, pp.569-584, 1994.
DOI : 10.1002/jgt.3190180605

H. A. Kierstead and W. T. Trotter, Competitive colorings of oriented graphs, Electron. J. Combin, vol.8, issue.15, 2001.

H. A. Kierstead, . Zs, and . Tuza, Marking games and the oriented game chromatic number of partial k-trees, Graphs Combin, vol.19, issue.1, pp.121-129, 2003.

H. A. Kierstead and D. Yang, Orderings on graphs and game coloring number. Order, pp.255-264, 2003.

H. A. Kierstead and D. Yang, Very asymmetric marking games. Order, pp.93-107, 2005.
DOI : 10.1007/s11083-005-9012-y

J. Ne?et?il and E. Sopena, On the oriented game chromatic number. Electron, J. Combin, vol.8, issue.13, 2001.

J. Wu and X. Zhu, Lower bounds for the game colouring number of partial k-trees and planar graphs, Discrete Mathematics, vol.308, issue.12, pp.2637-2642, 2008.
DOI : 10.1016/j.disc.2007.05.023

X. Zhu, The Game Coloring Number of Planar Graphs, Journal of Combinatorial Theory, Series B, vol.75, issue.2, pp.261-278, 2008.
DOI : 10.1006/jctb.1998.1878

X. Zhu, The game coloring number of pseudo partial k-trees, Discrete Mathematics, vol.215, issue.1-3, pp.245-262, 2000.
DOI : 10.1016/S0012-365X(99)00237-X

X. Zhu, Refined activation strategy for the marking game, Journal of Combinatorial Theory, Series B, vol.98, issue.1, pp.1-18, 2008.
DOI : 10.1016/j.jctb.2007.04.004