GAME CHROMATIC NUMBER OF (WnP2)-P-center dot center dot

Abstract

In this paper we find an exact value for the game chromatic number of the Cartesian product graph (WnP2)-P-center dot center dot of two graphs, n-wheel W-n and the path graph P-2. This extends a previous work of Sia on the game chromatic number of certain families of Cartesian product graphs. We prove that the game chromatic number of graph (WnP2)-P-center dot center dot is 5, if n >= 3.