This note proves that the game chromatic number of an outerplanar graph is at most 7. This improves the previous known upper bound of the game chromatic number of outerplanar graphs. (C) 1999 John Wiley & Sons, Inc.
机构:
Univ Paris 09, PSL, LAMSADE UMR7243, Paris, FranceUniv Paris 09, PSL, LAMSADE UMR7243, Paris, France
Gastineau, Nicolas
Holub, Premysl
论文数: 0引用数: 0
h-index: 0
机构:
Univ West Bohemia, Dept Math, European Ctr Excellence NTIS New Technol Informat, POB 314, Plzen 30614, Czech RepublicUniv Paris 09, PSL, LAMSADE UMR7243, Paris, France
Holub, Premysl
Togni, Olivier
论文数: 0引用数: 0
h-index: 0
机构:
Univ Bourgogne Franche Comte, Le2I FRE2005, F-21000 Dijon, FranceUniv Paris 09, PSL, LAMSADE UMR7243, Paris, France