Fast winning strategies for the maker-breaker domination game

DOI10.1016/j.entcs.2019.08.042OpenAlexW2978673482WikidataQ113317389 ScholiaQ113317389MaRDI QIDQ2132382

Sandi Klavžar, Vesna Iršič, Valentin Gledel

Publication date: 27 April 2022

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.042

zbMATH Keywords

treecycleperfect matchingdomination gamemaker-breaker domination gamemaker-breaker domination number

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Related Items (1)

The maker-maker domination game in forests

Cites Work

• Bounds on the maximum number of minimum dominating sets
• Game total domination for cycles and paths
• Characterisation of forests with trivial game domination numbers
• The domination game played on unions of graphs
• Domination game: extremal families for the 3/5-conjecture for forests
• On the game domination number of graphs with given minimum degree
• On graphs with largest possible game domination number
• Domination game played on trees and spanning subgraphs
• Trees with equal total domination and game total domination numbers
• How fast can maker win in fair biased games?
• Positional games
• Fast winning strategies in maker-breaker games
• The 3/5-conjecture for weakly \(S(K_{1, 3})\)-free forests
• Domination Game and an Imagination Strategy
• Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular Graphs
• Fast Strategies In Maker–Breaker Games Played on Random Boards
• Domination game on paths and cycles
• Efficient Winning Strategies in Random‐Turn Maker–Breaker Games
• Combinatorial Games
• Extremal Problems for Game Domination Number
• On a combinatorial game
• Biased positional games for which random strategies are nearly optimal

This page was built for publication: Fast winning strategies for the maker-breaker domination game