Game chromatic number of generalized Petersen graphs and Jahangir graphs
From MaRDI portal
Publication:2218005
DOI10.1155/2020/6475427zbMATH Open1499.05236OpenAlexW3016910203MaRDI QIDQ2218005FDOQ2218005
Khaled Alshehada, Ziad Kanaya, Ramy Shaheen
Publication date: 12 January 2021
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/6475427
Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)
Cites Work
- Title not available (Why is that?)
- Game chromatic number of outerplanar graphs
- The Map-Coloring Game
- Game chromatic number of Cartesian product graphs
- The game coloring number of planar graphs
- Efficient Graph Packing via Game Colouring
- Game chromatic number of toroidal grids
- The game chromatic number of some families of Cartesian product graphs
- Orderings on graphs and game coloring number
- On the game chromatic number of splitting graphs of path and cycle
- The complexity of coloring games on perfect graphs
- On caterpillars of game chromatic number 4
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)