The normal domination game in graphs

DOI10.1016/J.JCSS.2025.103751MaRDI QIDQ6859736zbMATH OpenFDO

Authors João Marcos Brito, Thiago Marcilon, N. Martins, Rudini M. Sampaio

Publication date 11 February 2026

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCSS.2025.103751

zbMATH Keywords

combinatorial game theorydomination gamemisère gamenormal gamepartizan variantPSPACE-hardnessSprague-Grundy theory

Mathematics Subject Classification ID

Games involving graphs (91A43)

Cites work

• A proof of the 3/5-conjecture in the domination game
• An introduction to game domination in graphs
• Combinatorial game theory
• Complexity of the game domination problem
• Domination game and an imagination strategy
• Extremal problems for game domination number
• scientific article; zbMATH DE number 3124339 (Why is no real title available?)
• scientific article; zbMATH DE number 3939267 (Why is no real title available?)
• scientific article; zbMATH DE number 3761989 (Why is no real title available?)
• scientific article; zbMATH DE number 139777 (Why is no real title available?)
• scientific article; zbMATH DE number 3521877 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• Kayles and Nimbers
• Misère quotients for impartial games
• Nim, a game with a complete mathematical theory.
• On the approximability of influence in social networks
• On the complexity of some two-person perfect-information games
• PSPACE-completeness of two graph coloring games
• The convex set forming game
• Unit disk graphs
• Über mathematische Kampfspiele.

This page was built for publication: The normal domination game in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6859736)