T. Bartnicki and J. Grytczuk, A Note on the Game Chromatic Index of Graphs, Graphs and Combinatorics, vol.24, issue.2
DOI : 10.1007/s00373-008-0774-z

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

T. Dinski and X. Zhu, A bound for the game chromatic number of graphs, Discrete Mathematics, vol.196, issue.1-3, pp.109-115, 1999.
DOI : 10.1016/S0012-365X(98)00197-6

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

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 D. Yang, Orderings on Graphs and Game Coloring Number, Order, vol.20, issue.3, pp.255-264, 2003.
DOI : 10.1023/B:ORDE.0000026489.93166.cb

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

X. Zhu, Refined activation strategy for the marking game, preprint, 2003.