Qiang Sun

The game chromatic number of generalized Mycielski graphs of paths and cycles

The graph coloring game is a two-player game in which the players alternately color an uncolored vertex of a graph $G$. The game chromatic number is the minimum number of colors needed for the first player to guarantee a win. We investigate this parameter for generalized Mycielski graphs $M_k(G)$, where $G$ is a path $...