Title of article
Relaxed game chromatic number of trees and outerplanar graphs Original Research Article
Author/Authors
Wenjie He، نويسنده , , Jiaojiao Wu، نويسنده , , Xuding Zhu، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
11
From page
209
To page
219
Abstract
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.
Keywords
Relaxed game chromatic number , Relaxed chromatic number , Improper chromatic number , Defective chromatic number , Tree , Outerplanar graph
Journal title
Discrete Mathematics
Serial Year
2004
Journal title
Discrete Mathematics
Record number
948874
Link To Document