Domination game: extremal families for the 3/5-conjecture for forests

DOI10.7151/DMGT.1931MaRDI QIDQ521754zbMATH OpenOpenAlexWikidataFDO

Authors Michael A. Henning, Christian Löwenstein

Publication date 12 April 2017

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.7151/dmgt.1931

zbMATH Keywords

3/5 conjecturedomination game

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) 2-person games (91A05) Games involving graphs (91A43)

Recommendations

• Domination game: extremal families of graphs for \(3/5\)-conjectures
• Domination game on forests
• Extremal problems for game domination number
• The 3/5-conjecture for weakly \(S(K_{1, 3})\)-free forests
• Domination game: a proof of the 3/5-conjecture for graphs with minimum degree at least two

Cites work

• Domination game and an imagination strategy
• Domination game critical graphs
• Domination game played on trees and spanning subgraphs
• Domination game: a proof of the 3/5-conjecture for graphs with minimum degree at least two
• Domination game: effect of edge- and vertex-removal
• Domination game: extremal families of graphs for \(3/5\)-conjectures
• Extremal problems for game domination number
• Realizations of the game domination number
• The domination game played on unions of graphs
• Total domination in graphs

Cited in

(25)

• Infinite families of circular and Möbius ladders that are total domination game critical
• Domination game and minimal edge cuts
• Cutting lemma and union lemma for the domination game
• 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
• The variety of domination games
• \( 1 / 2\)-conjectures on the domination game and claw-free graphs
• Fast winning strategies for the maker-breaker domination game
• General upper bound on the game domination number
• Maker-breaker domination number
• Trees with equal total domination and game total domination numbers
• Domination game: extremal families of graphs for \(3/5\)-conjectures
• Domination game on forests
• The 3/5-conjecture for weakly \(S(K_{1, 3})\)-free forests
• An introduction to game domination in graphs
• Domination game: a proof of the 3/5-conjecture for graphs with minimum degree at least two
• THE DOMINATION GAME ON SPLIT GRAPHS
• Connected domination game
• The enclaveless competition game
• Extremal problems for game domination number
• Connected domination game: predomination, Staller-start game, and lexicographic products
• Biased domination games
• A proof of the 3/5-conjecture in the domination game

This page was built for publication: Domination game: extremal families for the 3/5-conjecture for forests

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