The Coloring Game on Planar Graphs with Large Girth, by a result on Sparse Cactuses

Clément Charpentier

We denote by $\chi$ g (G) the game chromatic number of a graph G, which is the smallest number of colors Alice needs to win the coloring game on G. We know from Montassier et al. [M.…