# Maker-Breaker total domination game

## TL;DR

This paper introduces and analyzes the Maker-Breaker total domination game on graphs, exploring its outcomes, computational complexity, and connections to hypergraphs, with results on various graph classes and infinite families.

## Contribution

It defines the Maker-Breaker total domination game, establishes key lemmas, classifies outcomes on specific graph classes, and proves PSPACE-completeness on split and bipartite graphs.

## Key findings

- Infinitely many connected cubic graphs where Staller wins.
- No minimum degree condition guarantees Dominator's win.
- Game is PSPACE-complete on split and bipartite graphs.

## Abstract

Maker-Breaker total domination game in graphs is introduced as a natural counterpart to the Maker-Breaker domination game recently studied by Duch\^ene, Gledel, Parreau, and Renault. Both games are instances of the combinatorial Maker-Breaker games. The Maker-Breaker total domination game is played on a graph $G$ by two players who alternately take turns choosing vertices of $G$. The first player, Dominator, selects a vertex in order to totally dominate $G$ while the other player, Staller, forbids a vertex to Dominator in order to prevent him to reach his goal. It is shown that there are infinitely many connected cubic graphs in which Staller wins and that no minimum degree condition is sufficient to guarantee that Dominator wins when Staller starts the game. An amalgamation lemma is established and used to determine the outcome of the game played on grids. Cacti are also classified with respect to the outcome of the game. A connection between the game and hypergraphs is established. It is proved that the game is PSPACE-complete on split and bipartite graphs. Several problems and questions are also posed.