 Almost every known upper bound for the game chromatic number of graphs are obtained from bounds on the game coloring number.Cycle-restrictions on edges.If every edge of a graph formula_1 belongs to at most formula_17 cycles, then formula_18.