On the game total domination number
From MaRDI portal
Publication:1637096
DOI10.1007/s00373-018-1883-yzbMath1388.05122arXiv1706.01157OpenAlexW2624112056WikidataQ59072284 ScholiaQ59072284MaRDI QIDQ1637096
Publication date: 7 June 2018
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.01157
2-person games (91A05) Hypergraphs (05C65) 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
Perfect graphs for domination games ⋮ Maker-breaker total domination game ⋮ The Tuza–Vestergaard Theorem ⋮ General upper bound on the game domination number ⋮ Z-domination game ⋮ Unnamed Item ⋮ THE DOMINATION GAME ON SPLIT GRAPHS ⋮ Cutting lemma and union lemma for the domination game ⋮ Domination game on uniform hypergraphs ⋮ Total connected domination game ⋮ The variety of domination games ⋮ An Introduction to Game Domination in Graphs ⋮ Game total domination for cyclic bipartite graphs ⋮ Fractional domination game ⋮ Connected domination game played on Cartesian products
Cites Work
- Unnamed Item
- Game total domination for cycles and paths
- Bounds on the game transversal number in hypergraphs
- Total version of the domination game
- On the game domination number of graphs with given minimum degree
- The 4/5 upper bound on the game total domination number
- Domination game: effect of edge- and vertex-removal
- Domination game on forests
- Progress towards the total domination game \(\frac{3}{4}\)-conjecture
- Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game
- Domination Game and an Imagination Strategy
- Extremal Problems for Game Domination Number