An Introduction to Game Domination in Graphs
From MaRDI portal
Publication:3384114
DOI10.1007/978-3-030-58892-2_8zbMath1479.05225OpenAlexW3157530957MaRDI QIDQ3384114
Publication date: 14 December 2021
Published in: Developments in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-58892-2_8
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 (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Game total domination for cycles and paths
- Improved upper bounds on the domination number of graphs with minimum degree at least five
- Complexity of the game domination problem
- 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
- 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
- On the complexity of some two-person perfect-information games
- On the game total domination number
- Further progress on the heredity of the game domination number
- The 4/5 upper bound on the game total domination number
- Infinite families of circular and Möbius ladders that are total domination game critical
- Domination game and minimal edge cuts
- Cutting lemma and union lemma for the domination game
- Effect of predomination and vertex removal on the game total domination number of a graph
- On graphs with largest possible game domination number
- Game total domination critical graphs
- On domination game stable graphs and domination game edge-critical graphs
- Very well covered graphs
- Game domination number
- Domination game played on trees and spanning subgraphs
- Domination game: effect of edge- and vertex-removal
- Realizations of the game domination number
- Game total domination for cyclic bipartite graphs
- 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
- Competition parameters of a graph
- 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
- Models of Domination in Graphs
- Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two
- Some Common Properties for Regularizable Graphs, Edge-Critical Graphs and B-Graphs
- Domination game on paths and cycles
- THE DOMINATION GAME ON SPLIT GRAPHS
- Total Domination in Graphs
- Game domination numbers of a disjoint union of paths and cycles
- On graphs with small game domination number
- My Favorite Domination Game Conjectures
- Extremal Problems for Game Domination Number
- Some covering concepts in graphs
- Domination Games Played on Graphs
This page was built for publication: An Introduction to Game Domination in Graphs