Year: 2024
Type: preprint
Abstract: 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.
Source: arXiv (Cornell University)
Author: Chenoweth, Vesna Iršič
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: European Commission
Award: G5099342464
OpenAlex ID: W4394867232