Partition Strategies for the Maker–Breaker Domination Game

• Published in: Algorithmica Vol. 87; no. 2; pp. 191 - 222
• Main Authors: Bagan, Guillaume, Duchêne, Eric, Gledel, Valentin, Lehtilä, Tuomo, Parreau, Aline
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.02.2025; Springer Nature B.V; Springer Verlag
• Subjects: Algorithm Analysis and Problem Complexity; Algorithms; Apexes; Computer Science; Computer Systems Organization and Communication Networks; Data Structures and Information Theory; Games; Graph theory; Graphs; Mathematics; Mathematics of Computing; Partitions (mathematics); Players; Polynomials; Strategy; Theory of Computation; Interval graph; maker-breaker games; Dominating set; Positional games
• DOI: 10.1007/s00453-024-01280-x
• ISSN: 0178-4617

The Maker–Breaker domination game is a positional game played on a graph by two players called Dominator and Staller. The players alternately select a vertex of the graph that has not yet been chosen. Dominator wins if at some point the vertices she has chosen form a dominating set of the graph. Staller wins if Dominator cannot form a dominating set. Deciding if Dominator has a winning strategy has been shown to be a PSPACE-complete problem even when restricted to chordal or bipartite graphs. In this paper, we consider strategies for Dominator based on partitions of the graph into basic subgraphs where Dominator wins as the second player. Using partitions into cycles and edges (also called perfect [1,2]-factors), we show that Dominator always wins in regular graphs and that deciding whether Dominator has a winning strategy as a second player can be computed in polynomial time for outerplanar and block graphs. We then study partitions into subgraphs with two universal vertices, which is equivalent to considering the existence of pairing dominating sets with adjacent pairs. We show that in interval graphs, Dominator wins if and only if such a partition exists. In particular, this implies that deciding whether Dominator has a winning strategy playing second is in NP for interval graphs. We finally provide an algorithm in n k + 3 for interval graphs with at most k nested intervals.