Relaxed game chromatic number of trees and outerplanar graphs

被引:15
|
作者
He, WJ [1 ]
Wu, JJ
Zhu, XD
机构
[1] Hebei Univ Technol, Dept Appl Math, Tianjin 300130, Peoples R China
[2] Natl Sun Yat Sen Univ, Dept Appl Math, Kaohsiung 80424, Taiwan
关键词
relaxed game chromatic number; relaxed chromatic number; defective chromatic number; improper chromatic number; tree; outerplanar graph;
D O I
10.1016/j.disc.2003.08.006
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
This paper studies the relaxed game chromatic number of trees and outerplanar graphs. It is proved that if G is a tree then chi(g)(d)(G) less than or equal to 2 for d greater than or equal to 2. If G is an outerplanar graph, then chi(g)(d)(G) less than or equal to 5 for d greater than or equal to 2, and chi(g)(d)(G) greater than or equal to 3 for d less than or equal to 4. (C) 2003 Elsevier B.V. All rights reserved.
引用
收藏
页码:209 / 219
页数:11
相关论文
共 50 条