Complexity of the game domination problem

Boštjan Brešar, Paul Dorbec, Sandi Klavžar, Gašper Košmrlj, Gabriel Renault
2016 Theoretical Computer Science  
The game domination number is a graph invariant that arises from a game, which is related to graph domination in a similar way as the game chromatic number is related to graph coloring. In this paper we show that verifying whether the game domination number of a graph is bounded by a given integer is PSPACEcomplete. This contrasts the situation of the game coloring problem whose complexity is still unknown.
doi:10.1016/j.tcs.2016.07.025 fatcat:fch3lvrfzbe5xlsg2jjk4m64ki