A proof of the 3/5-conjecture in the domination game

DOI10.1016/J.EJC.2024.104034zbMATH Open1548.05241MaRDI QIDQ6612304

Leo Versteegen

Publication date: 30 September 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

domination gamegame domination numberoptimization game

Mathematics Subject Classification ID

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

• Total version of the domination game
• Domination game: extremal families for the 3/5-conjecture for forests
• 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
• General upper bound on the game domination number
• 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
• Extremal Problems for Game Domination Number
• Domination Games Played on Graphs

Related Items (1)

A proof of the 3/4-conjecture for the total domination game

This page was built for publication: A proof of the 3/5-conjecture in the domination game

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6612304)