Domination game on uniform hypergraphs
From MaRDI portal
Publication:1732097
DOI10.1016/j.dam.2018.11.013zbMath1407.05159arXiv1710.00298OpenAlexW2963150039MaRDI QIDQ1732097
Balázs Patkós, Zsolt Tuza, Máté Vizer, Csilla Bujtás
Publication date: 22 March 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.00298
2-person games (91A05) Hypergraphs (05C65) 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
Cites Work
- Unnamed Item
- Unnamed Item
- A characterization of hypergraphs with large domination number
- Game total domination for cycles and paths
- Bounds on the game transversal number in hypergraphs
- Total transversals and total domination in uniform hypergraphs
- Hypergraphs with large transversal number and with edge sizes at least four
- Hypergraphs with large domination number and with edge sizes at least three
- 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
- Transversals and domination in uniform hypergraphs
- Game list colouring of 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
- 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
- On-line Ramsey theory
- Domination game played on trees and spanning subgraphs
- Game saturation of intersecting families
- Realizations of the game domination number
- Trees with equal total domination and game total domination numbers
- The minimum number of vertices in uniform hypergraphs with given domination number
- Matching and domination numbers in \(r\)-uniform hypergraphs
- Game matching number of graphs
- Equality of domination and transversal numbers in hypergraphs
- Domination in hypergraphs
- Domination game on forests
- 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
- Efficient Graph Packing via Game Colouring
- Total Domination in Graphs
- Extremal Problems for Game Domination Number
