The disjoint domination game

DOI10.1016/j.disc.2015.04.028zbMath1334.05087arXiv1411.5184OpenAlexW648979152WikidataQ59072420 ScholiaQ59072420MaRDI QIDQ279227

Csilla Bujtás, Zsolt Tuza

Publication date: 27 April 2016

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

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

zbMATH Keywords

dominating setgames on graphsbiased gamecombinatorial gamedisjoint domination 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)

Related Items (13)

Trees with equal total domination and game total domination numbers ⋮ Progress towards the total domination game \(\frac{3}{4}\)-conjecture ⋮ Bounds on the game transversal number in hypergraphs ⋮ Paired-Domination Game Played in Graphs ⋮ General upper bound on the game domination number ⋮ Domination game and minimal edge cuts ⋮ On graphs with largest possible game domination number ⋮ How long can one bluff in the domination game? ⋮ Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game ⋮ Maker-Breaker domination game ⋮ Fractional domination game ⋮ Connected domination game played on Cartesian products ⋮ Connected domination game

Cites Work

• The domination game played on unions of graphs
• Transversals and domination in uniform hypergraphs
• 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 and an Imagination Strategy
• Hypergraph domination and strong independence
• Extremal Problems for Game Domination Number

This page was built for publication: The disjoint domination game