Domination game and minimal edge cuts
From MaRDI portal
Publication:1727767
DOI10.1016/j.disc.2018.12.001zbMath1405.05115arXiv1804.08991OpenAlexW2963658979MaRDI QIDQ1727767
Sandi Klavžar, Douglas F. Rall
Publication date: 20 February 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.08991
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Games on graphs (graph-theoretic aspects) (05C57)
Related Items
The independence coloring game on graphs, Perfect graphs for domination games, General upper bound on the game domination number, Z-domination game, Total connected domination game, An Introduction to Game Domination in Graphs, \( 1 / 2\)-conjectures on the domination game and claw-free graphs, Fractional domination game, Connected domination game: Predomination, Staller-start game, and lexicographic products, On Rall's 1/2-conjecture on the domination game
Cites Work
- The disjoint domination game
- 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
- The 4/5 upper bound on the game total domination number
- On graphs with largest possible game domination number
- On domination game stable graphs and domination game edge-critical graphs
- Domination game: effect of edge- and vertex-removal
- The game total domination problem is log-complete in PSPACE
- 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
- A New Game Invariant of Graphs: the Game Distinguishing Number
- Domination game on paths and cycles
- THE DOMINATION GAME ON SPLIT GRAPHS
- Extremal Problems for Game Domination Number