Hardness of Variants of the Graph Coloring Game

On Monotonicity in Maker-Breaker Graph Colouring Games

“…Indeed, in 2020 Costa, Pessoa, Sampaio, and Soares [9] proved that the both the vertex colouring game and the related greedy colouring game are PSPACE-complete (see [9] for more details). This result has since been extended by Marcilon, Martins, and Sampaio [17] to variants of the game where Breaker starts, or one or other of the players can pass their turn.…”