Complexity of the game connected domination problem

Iršič Chenoweth, Vesna (author)

The connected domination game is a variant 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.

• Language: English
• Keywords: connected domination game, complexity, PSPACE-complete
• Work type: Article
• Typology: 1.01 - Original Scientific Article
• Organization: FMF - Faculty of Mathematics and Physics
• Publication status: Published
• Publication version: Version of Record
• Publication date: 01.12.2025
• Year: 2025
• Number of pages: 11 str.
• Numbering: Vol. 1057, art. no. 115559
• PID: 20.500.12556/RUL-174590
• UDC: 519.17
• ISSN on article: 0304-3975
• DOI: 10.1016/j.tcs.2025.115559
• COBISS.SI-ID: 251830531
• Publication date in RUL: 06.10.2025

Record is a part of a journal

• Title: Theoretical computer science
• Shortened title: Theor. comp. sci.
• Publisher: Elsevier
• ISSN: 0304-3975
• COBISS.SI-ID: 26525952

Licences

• License: CC BY 4.0, Creative Commons Attribution 4.0 International
• Link: http://creativecommons.org/licenses/by/4.0/
• Description: This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Secondary language

• Language: Slovenian
• Keywords: povezana dominacijska igra, zahtevnost, PSPACE-polno