The domination game played on unions of graphs
From MaRDI portal
Publication:468438
DOI10.1016/J.DISC.2014.08.024zbMATH Open1302.05117OpenAlexW2075805173MaRDI QIDQ468438FDOQ468438
Authors: Paul Dorbec, Gašper Košmrlj, Gabriel Renault 
Publication date: 7 November 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2014.08.024
Recommendations
- Domination game on uniform hypergraphs
- Domination games played on graphs
- THE DOMINATION GAME ON SPLIT GRAPHS
- An introduction to game domination in graphs
- scientific article; zbMATH DE number 7355464
- Domination game played on trees and spanning subgraphs
- Domination games on infinite graphs
- Game domination numbers of a disjoint union of paths and cycles
- The domination game played on diameter 2 graphs
- Domination game played on a graph constructed from 1-sum of paths
2-person games (91A05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Winning ways for your mathematical plays. Vol. 1.
- Domination game and an imagination strategy
- Title not available (Why is that?)
- Extremal problems for game domination number
- Domination game played on trees and spanning subgraphs
- Realizations of the game domination number
- Domination game: extremal families of graphs for \(3/5\)-conjectures
- Dually Chordal Graphs
Cited In (53)
- Biased domination games
- Mycielskian of graphs with small game domination number
- Game total domination critical graphs
- Domination game and minimal edge cuts
- Cutting lemma and union lemma for the domination game
- Total dominating sequences in graphs
- Complexity of the game domination problem
- THE DOMINATION GAME ON SPLIT GRAPHS
- Effect of predomination and vertex removal on the game total domination number of a graph
- Paired-domination game played in graphs
- Total version of the domination game
- Connected domination game
- Trees with equal total domination and game total domination numbers
- The game total domination problem is log-complete in PSPACE
- Total connected domination game
- The disjoint domination game
- The graph distance game and some graph operations
- Game total domination for cycles and paths
- Maker-Breaker total domination game on cubic graphs
- Domination game critical graphs
- On the game domination number of graphs with given minimum degree
- On Rall's 1/2-conjecture on the domination game
- Domination game on paths and cycles
- Characterisation of forests with trivial game domination numbers
- Dominating sets reconfiguration under token sliding
- Title not available (Why is that?)
- Game domination numbers of a disjoint union of paths and cycles
- Domination game played on trees and spanning subgraphs
- Maker-breaker total domination game
- Domination game on powers of cycles
- Progress towards the total domination game \(\frac{3}{4}\)-conjecture
- Maker-breaker domination number
- Connected domination game played on Cartesian products
- The 4/5 upper bound on the game total domination number
- Fractional domination game
- Maker-Breaker domination game
- On graphs with largest possible game domination number
- \( 1 / 2\)-conjectures on the domination game and claw-free graphs
- Domination games on infinite graphs
- Domination game on uniform hypergraphs
- General upper bound on the game domination number
- Effect of vertex-removal on game total domination numbers
- Effect of an edge subdivision on game domination numbers
- Fast winning strategies for the maker-breaker domination game
- Domination game played on a graph constructed from 1-sum of paths
- An introduction to game domination in graphs
- The domination game played on diameter 2 graphs
- Domination game: extremal families for the 3/5-conjecture for forests
- How long can one bluff in the domination game?
- A search game on the union of graphs with immobile hider
- The variety of domination games
- Perfect graphs for domination games
- The 3/5-conjecture for weakly \(S(K_{1, 3})\)-free forests
This page was built for publication: The domination game played on unions of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q468438)
