Optimal strategies in fractional games: vertex cover and domination
DOI10.26493/1855-3974.2771.4DFzbMATH Open1548.05235MaRDI QIDQ6617233
Csilla Bujtás, Zsolt Tuza, Günter Rote
Publication date: 10 October 2024
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
2-person games (91A05) Hypergraphs (05C65) Games involving graphs (91A43) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Title not available (Why is that?)
- The disjoint domination game
- Bounds on the game transversal number in hypergraphs
- Total version of the domination game
- 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
- Transversal numbers of uniform hypergraphs
- The variety of domination games
- Domination game: effect of edge- and vertex-removal
- \( 1 / 2\)-conjectures on the domination game and claw-free graphs
- General upper bound on the game domination number
- Fractional domination game
- Perfect graphs for domination games
- 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
- The enclaveless competition game
- Extremal Problems for Game Domination Number
- Domination Games Played on Graphs
This page was built for publication: Optimal strategies in fractional games: vertex cover and domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6617233)
