Graph colorings with restricted bicolored subgraphs: II. The graph coloring game
From MaRDI portal
Publication:6081568
DOI10.1002/jgt.22786zbMath1522.05301arXiv2008.13275OpenAlexW3082098889MaRDI QIDQ6081568
No author found.
Publication date: 5 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.13275
Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57) Graph operations (line graphs, products, etc.) (05C76)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- On acyclic colorings of planar graphs
- A bound for the game chromatic number of graphs
- The game coloring number of pseudo partial \(k\)-trees
- Lower bounds for the game colouring number of partial \(k\)-trees and planar graphs
- Refined activation strategy for the marking game
- Game coloring the Cartesian product of graphs
- ON THE COMPLEXITY OF SOME COLORING GAMES
- Game chromatic number of Cartesian product graphs
This page was built for publication: Graph colorings with restricted bicolored subgraphs: II. The graph coloring game