General upper bound on the game domination number
From MaRDI portal
Publication:2197467
DOI10.1016/j.dam.2020.06.018zbMath1447.05130arXiv2002.00105OpenAlexW3038211331MaRDI QIDQ2197467
Publication date: 31 August 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.00105
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 (4)
Perfect graphs for domination games ⋮ Unnamed Item ⋮ \( 1 / 2\)-conjectures on the domination game and claw-free graphs ⋮ The domination game played on diameter 2 graphs
Cites Work
- The disjoint domination game
- Game total domination for cycles and paths
- Characterisation of forests with trivial game domination numbers
- Bounds on the game transversal number in hypergraphs
- The domination game played on unions of graphs
- Total version of 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
- On the game total domination number
- The 4/5 upper bound on the game total domination number
- Domination game and minimal edge cuts
- Effect of predomination and vertex removal on the game total domination number of a graph
- Domination game on uniform hypergraphs
- On graphs with largest possible game domination number
- Game total domination critical graphs
- On domination game stable graphs and domination game edge-critical graphs
- The variety of domination games
- Domination game: effect of edge- and vertex-removal
- Connected domination game played on Cartesian products
- Game total domination for cyclic bipartite graphs
- Fractional domination game
- 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
- Domination game on paths and cycles
- Connected domination game
- Extremal Problems for Game Domination Number
This page was built for publication: General upper bound on the game domination number