Maker-breaker domination number
DOI10.1007/s40840-019-00757-1zbMath1418.05096arXiv1810.04397OpenAlexW2896317154WikidataQ128120402 ScholiaQ128120402MaRDI QIDQ2317950
Vesna Iršič, Valentin Gledel, Sandi Klavžar
Publication date: 13 August 2019
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.04397
treecycleperfect matchingdomination gameunion of graphsmaker-breaker domination gamemaker-breaker domination number
Games involving graphs (91A43) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (6)
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
- Maker-Breaker domination game
- 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: Maker-breaker domination number
