Domination game critical graphs
DOI10.7151/DMGT.1839zbMATH Open1327.05256DBLPjournals/dmgt/BujtasKK15OpenAlexW2209194806WikidataQ59072466 ScholiaQ59072466MaRDI QIDQ891326FDOQ891326
Authors: Csilla Bujtás, Sandi Klavžar, Gašper Košmrlj 
Publication date: 17 November 2015
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1839
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Graph theory
- Domination game and an imagination strategy
- Matching theory
- The domination game played on unions of graphs
- Title not available (Why is that?)
- Total version of the domination game
- Extremal problems for game domination number
- 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
- Vertex domination-critical graphs
- Domination dot-critical graphs
- On the game domination number of graphs with given minimum degree
- Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees
- The connectivity of domination dot-critical graphs with no critical vertices
- Minimal dominating sets of cardinality two in a graph
- The 4/5 upper bound on the game total domination number
- Critical graphs without triangles: an optimum density construction
- Upper bounds on the diameter of domination dot-critical graphs with given connectivity
- Distance domination-critical graphs
- Title not available (Why is that?)
Cited In (23)
- Game total domination critical graphs
- Cutting lemma and union lemma for the domination game
- On game chromatic vertex-critical graphs
- On domination game stable graphs and domination game edge-critical graphs
- Connected domination game: predomination, Staller-start game, and lexicographic products
- Complexity of the game domination problem
- Effect of predomination and vertex removal on the game total domination number of a graph
- Paired-domination game played in graphs
- Connected domination game
- Trees with equal total domination and game total domination numbers
- Game total domination for cycles and paths
- Game total domination for cyclic bipartite graphs
- Predominating a vertex in the connected domination game
- Power contamination and domination on the grid
- Domination game on powers of cycles
- Progress towards the total domination game \(\frac{3}{4}\)-conjecture
- The 4/5 upper bound on the game total domination number
- On graphs with largest possible game domination number
- Domination game on uniform hypergraphs
- Z-domination game
- Infinite families of circular and Möbius ladders that are total domination game critical
- Domination game: extremal families for the 3/5-conjecture for forests
- How long can one bluff in the domination game?
This page was built for publication: Domination game critical graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q891326)
