Game chromatic number of toroidal grids

Authors:
Andre Raspaud;Jiaojiao Wu
Affiliations:
LaBRI, Universite Bordeaux I, 33405 Talence Cedex, France;LaBRI, Universite Bordeaux I, 33405 Talence Cedex, France
Venue:
Information Processing Letters
Year:
2009

Citing 6
Cited 0

Planar graph coloring with an uncooperative partner

Journal of Graph Theory
The game coloring number of planar graphs

Journal of Combinatorial Theory Series B
The game coloring number of pseudo partial k-trees

Discrete Mathematics
Refined activation strategy for the marking game

Journal of Combinatorial Theory Series B
Game chromatic number of outerplanar graphs

Journal of Graph Theory
Game coloring the Cartesian product of graphs

Journal of Graph Theory

Quantified Score

Hi-index	0.89

Visualization

Abstract

A toroidal grid graph C"m@?C"n is the Cartesian product of two cycles. We prove @g"g(TG)=col"g(TG)=5 for the family of toroidal grids TG. Moreover, we prove @g"g(C"2"m@?C"n)=5 for m=3 and n=7.