Game chromatic number of generalized Petersen graphs and Jahangir graphs
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}\).
- Efficient graph packing via game colouring
- Game chromatic number of Cartesian product graphs
- Game chromatic number of outerplanar graphs
- Game chromatic number of toroidal grids
- scientific article; zbMATH DE number 398953 (Why is no real title available?)
- On caterpillars of game chromatic number 4
- On the game chromatic number of splitting graphs of path and cycle
- Orderings on graphs and game coloring number
- The complexity of coloring games on perfect graphs
- The game chromatic number of some families of Cartesian product graphs
- The game coloring number of planar graphs
- The Map-Coloring Game
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)