Game chromatic number of honeycomb related networks

Let G be a simple connected graph having finite number of vertices (nodes). Let a coloring game is played on the nodes of G by two players, Alice and Bob alternately assign colors to the nodes such that the adjacent nodes receive different colors with Alice taking first turn. Bob wins the game if he is succeeded to assign k distinct colors in the neighborhood of some vertex, where k is the available number of colors, otherwise Alice wins. The game chromatic number of G is the minimum number of colors that are needed for Alice to win this coloring game and is denoted by χg(G). In this paper, the game chromatic number χg(G) for some interconnecting networks such as infinite honeycomb network, elementary wall of infinite height and infinite octagonal network is determined. Also, the bounds for the game chromatic number χg(G) of infinite oxide network are explored.