%0 Journal Article %T Game Chromatic Number of Some Regular Graphs %A Ramy Shaheen %A Ziad Kanaya %A Khaled Alshehada %J Open Journal of Discrete Mathematics %P 159-164 %@ 2161-7643 %D 2019 %I Scientific Research Publishing %R 10.4236/ojdm.2019.94012 %X Let G be a graph and k be a positive integer. We consider a game with two players Alice and Bob who alternate in coloring the vertices of G with a set of k colors. In every turn, one vertex will be chosen by one player. Alice¡¯s goal is to color all vertices with the k colors, while Bob¡¯s goal is to prevent her. The game chromatic number denoted by χg(G), is the smallest k such that Alice has a winning strategy with k colors. In this paper, we determine the game chromatic number χg of circulant graphs Cn(1,2), \"\" , and generalized Petersen graphs GP(n,2), GP(n,3). %K Game Chromatic Number %K Circulant Graph %K Generalized Petersen Graphs %U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=96005