Back to Search Start Over

Relaxed game chromatic number of trees and outerplanar graphs

Authors :
He, Wenjie
Wu, Jiaojiao
Zhu, Xuding
Source :
Discrete Mathematics. Apr2004, Vol. 281 Issue 1-3, p209. 11p.
Publication Year :
2004

Abstract

This paper studies the relaxed game chromatic number of trees and outerplanar graphs. It is proved that if <f>G</f> is a tree then <f>χgd(G)⩽2</f> for <f>d⩾2</f>. If <f>G</f> is an outerplanar graph, then <f>χgd(G)⩽5</f> for <f>d⩾2</f>, and <f>χgd(G)⩾3</f> for <f>d⩽4</f>. [Copyright &y& Elsevier]

Subjects

Subjects :
*GRAPHIC methods
*GEOMETRICAL drawing
*GRAPH theory
*GRAPHIC statics

Details

Language :
English
ISSN :
0012365X
Volume :
281
Issue :
1-3
Database :
Academic Search Index
Journal :
Discrete Mathematics
Publication Type :
Academic Journal
Accession number :
12642371
Full Text :
https://doi.org/10.1016/j.disc.2003.08.006
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details