Title of article
Refined activation strategy for the marking game
Author/Authors
Zhu، نويسنده , , Xuding، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
18
From page
1
To page
18
Abstract
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.
Keywords
game colouring number , game chromatic number , Activation strategy , Planar graph , Refined activation strategy
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2008
Journal title
Journal of Combinatorial Theory Series B
Record number
1528652
Link To Document