The Game Coloring Number of Planar Graphs
The Game Coloring Number of Planar Graphs
复制标题
DOI：
10.1006/jctb.1998.1878
复制
发表时间：
1999-03
期刊：
影响因子：
--
通讯作者：
Xuding Zhu
中科院分区：
文献类型：
--
作者：
Xuding Zhu
本文讨论了图的对策色数的一种变体：对策色数。该参数提供了图的对策色数的上界。证明了平面图的对策色数至多为19，这意味着平面图的对策色数至多为19，改进了已知的平面图对策色数的上界。
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.