How long can one bluff in the domination game?
From MaRDI portal
Publication:521751
DOI10.7151/dmgt.1899zbMath1359.05081OpenAlexW2600235998MaRDI QIDQ521751
Boštan Brešar, Paul Dorbec, Sandi Klavžar, Gašper Košmrlj
Publication date: 12 April 2017
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1899
generalized Petersen graphsCartesian product of graphsdomination gameHamming graphsKneser graphsgame domination numberbluff graphsminus graphs
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)
Related Items
Mycielskian of graphs with small game domination number ⋮ Unnamed Item ⋮ Z-domination game ⋮ THE DOMINATION GAME ON SPLIT GRAPHS ⋮ 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 ⋮ The switch operators and push-the-button games: a sequential compound over rulesets ⋮ The variety of domination games ⋮ Game total domination critical graphs ⋮ On domination game stable graphs and domination game edge-critical graphs ⋮ An Introduction to Game Domination in Graphs ⋮ Effect of an edge subdivision on game domination numbers ⋮ Connected domination game played on Cartesian products ⋮ Connected domination game
Cites Work
- Unnamed Item
- Unnamed Item
- The disjoint domination game
- Improved upper bounds on the domination number of graphs with minimum degree at least five
- Characterisation of forests with trivial game domination numbers
- The domination game played on unions of graphs
- Total version of the domination game
- Dominating sequences in graphs
- On the game domination number of graphs with given minimum degree
- Domination game critical graphs
- Minimal dominating sets of cardinality two in a graph
- 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