Incidence coloring game and arboricity of graphs

Clément Charpentier, Eric Sopena

An incidence of a graph $G$ is a pair $(v,e)$ where $v$ is a vertex of $G$ and $e$ an edge incident to $v$. Two incidences $(v,e)$ and $(w,f)$ are adjacent whenever $v=w$, or $e…