The Maker–Maker domination game in forests

We study the Maker–Maker version of the domination game introduced in 2018 by Duchêne et al. Given a graph, two players alternately claim vertices. The first player to claim a dominating set of the graph wins. As the Maker–Breaker version, this game is PSPACE-complete on split and bipartite graphs....

Full description

Saved in:
Bibliographic Details
Published inDiscrete Applied Mathematics Vol. 348; pp. 6 - 34
Main Authors Duchêne, Eric, Dumas, Arthur, Oijid, Nacim, Parreau, Aline, Rémila, Eric
Format Journal Article
LanguageEnglish
Published Elsevier B.V 15.05.2024
Elsevier
Subjects
Combinatorics
Computational Complexity
Computer Science
Dominating set
Domination game
Graphs
Maker–Breaker games
Maker–Maker games
Mathematics
Positional games
PSPACE-completeness
Maker–Breaker games
Dominating set
Maker–Maker games
PSPACE-completeness
Graphs
Positional games
Domination game
Maker-Maker Games
Positional Games
Maker-Breaker Games
domination game
Online AccessGet full text

Cover

More Information
Summary:We study the Maker–Maker version of the domination game introduced in 2018 by Duchêne et al. Given a graph, two players alternately claim vertices. The first player to claim a dominating set of the graph wins. As the Maker–Breaker version, this game is PSPACE-complete on split and bipartite graphs. Our main result is a linear time algorithm to solve this game in forests. We also give a characterization of the cycles where the first player has a winning strategy.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2024.01.023