The connected domination game is a variation of the domination game where the played vertices must form a connected subgraph at all stages of the game. In this paper we prove that deciding whether the game connected domination number is smaller than a given integer is PSPACE-complete using log-space reductions for both Dominator- and Staller-start connected domination game.
@article{arxiv.2404.08776,
title = {Complexity of the game connected domination problem},
author = {Vesna Iršič Chenoweth},
journal= {arXiv preprint arXiv:2404.08776},
year = {2025}
}