A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
We denote by χ 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. Montassier, P. Ossona de Mendez, A. Raspaud and X. Zhu, Decomposing a graph into forests, J. Graph Theory Ser. B, 102(1):38-52, 2012] and, independantly, from Wang and Zhang, [Y. Wang and Q. Zhang. Decomposing a planar graph with girth at least 8 into a forest and a matching, Discrete Maths, 311:844-849, 2011] thatarXiv:1507.03195v1 fatcat:34nn5523jjeafj2bzp33spsrtm