Complexity of the Game Domination Problem

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.

[1]  Gasper Kosmrlj,et al.  Domination game: Extremal families of graphs for 3/53/5-conjectures , 2013, Discret. Appl. Math..

[2]  Takehiro Ito,et al.  Reconfiguration of List L(2, 1)-Labelings in a Graph , 2012, ISAAC.

[3]  Csilla Bujtás,et al.  Domination Game Critical Graphs , 2015, Discuss. Math. Graph Theory.

[4]  Simon Schmidt.  The 3/5-conjecture for weakly S(K1, 3)-free forests , 2016, Discret. Math..

[5]  Hovhannes Tananyan.  Domination games played on line graphs of complete multipartite graphs , 2014, ArXiv.

[6]  Paul Dorbec,et al.  The domination game played on unions of graphs , 2015, Discret. Math..

[7]  Gasper Kosmrlj.  Realizations of the game domination number , 2014, J. Comb. Optim..

[8]  Thomas J. Schaefer,et al.  On the Complexity of Some Two-Person Perfect-Information Games , 1978, J. Comput. Syst. Sci..

[9]  Simon Schmidt,et al.  On the Computational Complexity of the Domination Game , 2015 .

[10]  Csilla Bujtás.  On the Game Domination Number of Graphs with Given Minimum Degree , 2015, Electron. J. Comb..

[11]  Paul Dorbec,et al.  Domination game: Effect of edge- and vertex-removal , 2013, Discret. Math..

[12]  Sandi Klavzar,et al.  Domination Game and an Imagination Strategy , 2010, SIAM J. Discret. Math..

[13]  Sandi Klavzar,et al.  Domination game played on trees and spanning subgraphs , 2013, Discret. Math..

[14]  Daniel Grier.  Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete , 2013, ICALP.

[15]  Csilla Bujtás.  Domination game on forests , 2015, Discret. Math..

[16]  Hossein Soltani,et al.  Characterisation of forests with trivial game domination numbers , 2016, J. Comb. Optim..

[17]  Dorian Mazauric,et al.  To satisfy impatient Web surfers is hard , 2012, Theor. Comput. Sci..

[18]  Hans L. Bodlaender.  On the Complexity of Some Coloring Games , 1991, Int. J. Found. Comput. Sci..

[19]  Gasper Kosmrlj,et al.  On graphs with small game domination number , 2016 .

[20]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[21]  Reza Zamani,et al.  Extremal Problems for Game Domination Number , 2013, SIAM J. Discret. Math..

[22]  Albert Atserias,et al.  Bounded-width QBF is PSPACE-complete , 2014, J. Comput. Syst. Sci..

[23]  Michael A. Henning,et al.  Domination Game: A proof of the 3/5-Conjecture for Graphs with Minimum Degree at Least Two , 2016, SIAM J. Discret. Math..

[24]  Takehiro Ito,et al.  Reconfiguration of list L(2,1)-labelings in a graph , 2014, Theor. Comput. Sci..

[25]  Xuding Zhu,et al.  The Map-Coloring Game , 2007, Am. Math. Mon..

[26]  Pim van 't Hof,et al.  Computing role assignments of proper interval graphs in polynomial time , 2010, J. Discrete Algorithms.

[27]  Peter Jeavons,et al.  The complexity of constraint satisfaction games and QCSP , 2009, Inf. Comput..