Prefer a chat interface with context about you and your work?
Game coloring the Cartesian product of graphs
Abstract This article proves the following result: Let G and G ′ be graphs of orders n and n ′, respectively. Let G * be obtained from G by adding to each vertex a set of n ′ degree 1 neighbors. If G * has game coloring number m and …