Characterisation of forests with trivial game domination numbers
DOI10.1007/S10878-015-9903-9zbMATH Open1348.05136OpenAlexW2266104145MaRDI QIDQ326480FDOQ326480
Authors: Hossein Soltani, Mohammad Javad Nadjafi-Arani, Mark Siggers 
Publication date: 12 October 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9903-9
Recommendations
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)
Cites Work
- Domination Game and an Imagination Strategy
- The domination game played on unions of graphs
- Total version of the domination game
- Extremal Problems for 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
- Title not available (Why is that?)
Cited In (24)
- Game total domination critical graphs
- Domination game and minimal edge cuts
- Cutting lemma and union lemma for the domination game
- On domination game stable graphs and domination game edge-critical graphs
- Complexity of the game domination problem
- Effect of predomination and vertex removal on the game total domination number of a graph
- On graphs with equal total domination and Grundy total domination numbers
- Trees with equal total domination and game total domination numbers
- An Introduction to Game Domination in Graphs
- Predominating a vertex in the connected domination game
- Maker-breaker total domination game
- Maker-breaker domination number
- Fractional domination game
- On graphs with largest possible game domination number
- \( 1 / 2\)-conjectures on the domination game and claw-free graphs
- General upper bound on the game domination number
- Fast winning strategies for the maker-breaker domination game
- Z-domination game
- The domination game played on diameter 2 graphs
- Infinite families of circular and Möbius ladders that are total domination game critical
- How long can one bluff in the domination game?
- The variety of domination games
- Perfect graphs for domination games
- The 3/5-conjecture for weakly \(S(K_{1, 3})\)-free forests
This page was built for publication: Characterisation of forests with trivial game domination numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326480)
