Refined activation strategy for the marking game

This paper introduces a new strategy for playing the marking game on graphs. Using this strategy, we prove that if G is a planar graph, then the game colouring number of G, and hence the game chromatic number of G, is at most 17.

• Type: Journal
• Year: 2008
• Where: JCT
• Authors: Xuding Zhu
• Keywords: Game, JCT 2008, Marking Game, Planar Graph