 For a class formula_19 of graphs, we denote by formula_20 the smallest integer formula_10 such that every graph formula_1 of formula_19 has formula_24.In other words, formula_20 is the exact upper bound for the game chromatic number of graphs in this class.This value is known for several standard graph classes, and bounded for some others