Fractional domination game
From MaRDI portal
Publication:2327216
zbMath1422.05068MaRDI QIDQ2327216
Publication date: 14 October 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v26i4p3
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 (5)
Predominating a vertex in the connected domination game ⋮ Maker-Breaker total domination game on cubic graphs ⋮ General upper bound on the game domination number ⋮ On Rall's 1/2-conjecture on the domination game ⋮ The domination game played on diameter 2 graphs
Cites Work
- Unnamed Item
- Unnamed Item
- The disjoint domination game
- Game total domination for cycles and paths
- 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
- Domination, independent domination, and duality in strongly chordal graphs
- 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
- Transversal numbers of uniform hypergraphs
- Domination game: effect of edge- and vertex-removal
- 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: Fractional domination game
