Game chromatic number of generalized Petersen graphs and Jahangir graphs

From MaRDI portal
Publication:2218005





Summary: Let \(G=(V,E)\) be a graph, and two players Alice and Bob alternate turns coloring the vertices of the graph \(G\) a proper coloring where no two adjacent vertices are signed with the same color. Alice's goal is to color the set of vertices using the minimum number of colors, which is called game chromatic number and is denoted by \(\chi_g (G)\), while Bob's goal is to prevent Alice's goal. In this paper, we investigate the game chromatic number \(\chi_g (G)\) of Generalized Petersen Graphs \(GP(n,k)\) for \(k\geq 3\) and arbitrary \(n,n\)-Crossed Prism Graph, and Jahangir Graph \(J_{n,m}\).











This page was built for publication: Game chromatic number of generalized Petersen graphs and Jahangir graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2218005)