A proof of the 3/4-conjecture for the total domination game
From MaRDI portal
Publication:6668346
DOI10.1137/23M1551584MaRDI QIDQ6668346
Leo Versteegen, Julien Portier
Publication date: 22 January 2025
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
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)
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
- Maker-Breaker domination game
- 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 on uniform hypergraphs
- Game domination number
- The variety of domination games
- \( 1 / 2\)-conjectures on the domination game and claw-free graphs
- Connected domination game played on Cartesian products
- Maker-breaker total domination game
- General upper bound on the game domination number
- Fractional domination game
- 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
- Connected domination game
- Extremal Problems for Game Domination Number
- Domination Games Played on Graphs
- A proof of the 3/5-conjecture in the domination game
This page was built for publication: A proof of the 3/4-conjecture for the total domination game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6668346)
