The game chromatic number of dense random graphs

Ralph Keusch, Angelika Steger

Suppose that two players take turns coloring the vertices of a given graph G with k colors. In each move the current player colors a vertex such that neighboring vertices get diffe…