The 3/5-conjecture for weakly \(S(K_{1, 3})\)-free forests

DOI10.1016/j.disc.2016.05.017zbMath1339.05295arXiv1507.02875OpenAlexW2963325533WikidataQ123132937 ScholiaQ123132937MaRDI QIDQ2629288

Simon Schmidt

Publication date: 5 July 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.02875

zbMATH Keywords

domination game3 / 5-conjecture

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)

Related Items (16)

Fast winning strategies for the maker-breaker domination game ⋮ Complexity of the game domination problem ⋮ Mycielskian of graphs with small game domination number ⋮ General upper bound on the game domination number ⋮ 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 ⋮ Bounds on the 2-domination number ⋮ On graphs with largest possible game domination number ⋮ The enclaveless competition game ⋮ The variety of domination games ⋮ Game total domination critical graphs ⋮ An Introduction to Game Domination in Graphs ⋮ Maker-breaker domination number ⋮ Fractional domination game

Cites Work

• Characterisation of forests with trivial game domination numbers
• The domination game played on unions of graphs
• Total version of the domination game
• On the game domination number of graphs with given minimum degree
• Domination game played on trees and spanning subgraphs
• Domination game: effect of edge- and vertex-removal
• Realizations of the game domination number
• Domination game: extremal families of graphs for \(3/5\)-conjectures
• Domination game on forests
• 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

This page was built for publication: The 3/5-conjecture for weakly \(S(K_{1, 3})\)-free forests