Title of article
The Game Coloring Number of Planar Graphs
Author/Authors
Zhu، نويسنده , , Xuding، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
14
From page
245
To page
258
Abstract
This paper discusses a variation of the game chromatic number of a graph: the game coloring number. This parameter provides an upper bound for the game chromatic number of a graph. We show that the game coloring number of a planar graph is at most 19. This implies that the game chromatic number of a planar graph is at most 19, which improves the previous known upper bound for the game chromatic number of planar graphs.
Keywords
Linear order , game chromatic number , light edge , Planar graph , back degree , coloring number , decomposition , game coloring number
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1999
Journal title
Journal of Combinatorial Theory Series B
Record number
1526475
Link To Document