Complexity of the Game Domination Problem
Combinatorics
2016-06-20 v2 Computational Complexity
Abstract
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 PSPACE-complete. This contrasts the situation of the game coloring problem whose complexity is still unknown.
Cite
@article{arxiv.1510.00140,
title = {Complexity of the Game Domination Problem},
author = {Boštjan Brešar and Paul Dorbec and Sandi Klavžar and Gašper Košmrlj and Gabriel Renault},
journal= {arXiv preprint arXiv:1510.00140},
year = {2016}
}
Comments
14 pages, 3 figures