3 papers
cs.DM2019
A Connected Version of the Graph Coloring Game
Eric Sopena, Clément Charpentier, Hervé Hocquard +1
The graph coloring game is a two-player game in which, given a graph G and a set of k colors, the two players, Alice and Bob, take turns coloring properly an uncolored vertex of G,…
cs.DM2015
The Coloring Game on Planar Graphs with Large Girth, by a result on Sparse Cactuses
Clément Charpentier
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.…
cs.DM2013
Incidence coloring game and arboricity of graphs
Clément Charpentier, Eric Sopena
An incidence of a graph is a pair where is a vertex of and an edge incident to . Two incidences and are adjacent whenever , or $e…