H. Bodlaender, On the complexity of some coloring games, Lecture notes in Computer Science, vol.484, pp.30-40, 1991.
DOI : 10.1007/3-540-53832-1_29

L. Cai and X. Zhu, Game chromatic index ofk-degenerate graphs, Journal of Graph Theory, vol.75, issue.3, pp.144-155, 2001.
DOI : 10.1002/1097-0118(200103)36:3<144::AID-JGT1002>3.0.CO;2-F

C. Chou, W. Wang, and X. Zhu, Relaxed game chromatic number of graphs, Discrete Mathematics, vol.262, issue.1-3, pp.89-98, 2003.
DOI : 10.1016/S0012-365X(02)00521-6

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

C. Dunn, The relaxed game chromatic index of k-degenerate graphs, Discrete Mathematics, vol.307, issue.14, pp.1767-1775, 2007.
DOI : 10.1016/j.disc.2006.09.025

C. Dunn, J. F. Nordstrom, C. Naymie, E. Pitney, W. Sehorn et al., Clique-relaxed graph coloring, Involve, a Journal of Mathematics, vol.4, issue.2, pp.127-138, 2011.
DOI : 10.2140/involve.2011.4.127

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

C. Dunn and H. A. Kierstead, The relaxed game chromatic number of outerplanar graphs, Journal of Graph Theory, vol.215, issue.1, pp.46-69, 2004.
DOI : 10.1002/jgt.10172

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

M. Gardner, Mathematical Games, Scientific American, 1981.

D. Guan and X. Xhu, 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

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. 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

P. Lam, W. Shiu, and B. Xu, Edge game-coloring of graphs Graph Theory Notes of, pp.17-19, 1999.

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, 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