Maker-breaker total domination game
DOI10.1016/j.dam.2019.11.004zbMath1441.05157arXiv1902.00204OpenAlexW2991843514MaRDI QIDQ2185735
Vesna Iršič, Michael A. Henning, Sandi Klavžar, Valentin Gledel
Publication date: 5 June 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.00204
hypergraphPSPACE-completenesscactusCartesian product of graphsmaker-breaker domination gamemaker-breaker total domination game
Hypergraphs (05C65) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57) Graph operations (line graphs, products, etc.) (05C76)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Characterisation of forests with trivial game domination numbers
- The domination game played on unions of graphs
- Total version of the domination game
- Maker-Breaker domination game
- On the game domination number of graphs with given minimum degree
- On chooser-picker positional games
- On the complexity of some two-person perfect-information games
- On the game total domination number
- The 4/5 upper bound on the game total domination number
- On graphs with largest possible game domination number
- Game total domination critical graphs
- Partitioning the vertices of a cubic graph into two total dominating sets
- Game total domination for cyclic bipartite graphs
- On coupon colorings of graphs
- The game total domination problem is log-complete in PSPACE
- Positional games
- Perfect graphs for domination games
- Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game
- Domination Game and an Imagination Strategy
- Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two
- Total domination in graphs
- Biased Positional Games
- Thoroughly dispersed colorings
- Total Domination in Graphs
- Combinatorial Games
- Extremal Problems for Game Domination Number
- On a combinatorial game
- Biased positional games for which random strategies are nearly optimal