Relaxed game chromatic number of trees and outerplanar graphs
Relaxed game chromatic number of trees and outerplanar graphs
复制标题
DOI：
10.1016/j.disc.2003.08.006
复制
发表时间：
2004-04
期刊：
影响因子：
--
通讯作者：
Wenjie He;Jiaojiao Wu;Xuding Zhu
中科院分区：
文献类型：
--
作者：
Wenjie He;Jiaojiao Wu;Xuding Zhu
本文研究了树和外平面图的松弛对策色数。证明了如果G是树，则χgd(G)⩽2有d⩾2.如果G是外平面图，则χgd(G)⩽5有d⩾2，χgd(G)⩾3有d⩽4.
This paper studies the relaxed game chromatic number of trees and outerplanar graphs. It is proved that if G is a tree then χgd(G)⩽2 for d⩾2. If G is an outerplanar graph, then χgd(G)⩽5 for d⩾2, and χgd(G)⩾3 for d⩽4.