The game Grundy indices of graphs
From MaRDI portal
Publication:498433
DOI10.1007/s10878-013-9657-1zbMath1335.91024OpenAlexW2093133570MaRDI QIDQ498433
Publication date: 28 September 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-013-9657-1
Cites Work
- Role of the memory in convergence to invariant Gibbs measure
- A bound for the game chromatic number of graphs
- The game coloring number of planar graphs
- A simple competitive graph coloring algorithm
- The game Grundy number of graphs
- Refined activation strategy for the marking game
- ON THE COMPLEXITY OF SOME COLORING GAMES
- Radius two trees specify χ‐bounded classes
- The Map-Coloring Game
This page was built for publication: The game Grundy indices of graphs