Game total domination critical graphs
From MaRDI portal
Publication:1801040
DOI10.1016/j.dam.2018.04.014zbMath1398.05135arXiv1709.06069OpenAlexW2963989423WikidataQ129882638 ScholiaQ129882638MaRDI QIDQ1801040
Sandi Klavžar, Douglas F. Rall, Michael A. Henning
Publication date: 26 October 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.06069
2-person games (91A05) 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 (16)
Predominating a vertex in the connected domination game ⋮ Perfect graphs for domination games ⋮ Maker-breaker total domination game ⋮ General upper bound on the game domination number ⋮ Z-domination game ⋮ Infinite families of circular and Möbius ladders that are total domination game critical ⋮ Unnamed Item ⋮ Domination game on uniform hypergraphs ⋮ The variety of domination games ⋮ On domination game stable graphs and domination game edge-critical graphs ⋮ An Introduction to Game Domination in Graphs ⋮ Game total domination for cyclic bipartite graphs ⋮ Fractional domination game ⋮ Connected domination game: Predomination, Staller-start game, and lexicographic products ⋮ On game chromatic vertex-critical graphs ⋮ Connected domination game
Cites Work
- Game total domination for cycles and paths
- Complexity of the game domination problem
- Characterisation of forests with trivial game domination numbers
- The domination game played on unions of graphs
- Total version of the domination game
- How long can one bluff in the domination game?
- Domination game: extremal families for the 3/5-conjecture for forests
- On the game domination number of graphs with given minimum degree
- Domination game critical graphs
- The 4/5 upper bound on the game total domination number
- Realizations of the game domination number
- Trees with equal total domination and game total domination numbers
- The game total domination problem is log-complete in PSPACE
- Domination game: extremal families of graphs for \(3/5\)-conjectures
- Domination game on forests
- Progress towards the total domination game \(\frac{3}{4}\)-conjecture
- The 3/5-conjecture for weakly \(S(K_{1, 3})\)-free forests
- 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
- Extremal Problems for Game Domination Number
This page was built for publication: Game total domination critical graphs