Domination game critical graphs

DOI10.7151/DMGT.1839MaRDI QIDQ891326zbMATH OpenOpenAlexDBLPWikidataFDO

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)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.7151/dmgt.1839

zbMATH Keywords

domination gamedomination game critical graphsdomination numberpowers of cyclestrees

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Domination game on powers of cycles
• Game total domination critical graphs
• Domination game on paths and cycles
• On domination game stable graphs and domination game edge-critical graphs
• Domination game: effect of edge- and vertex-removal

Cites work

• Critical graphs without triangles: an optimum density construction
• Distance domination-critical graphs
• Domination dot-critical graphs
• Domination game and an imagination strategy
• Domination game on forests
• Domination game: effect of edge- and vertex-removal
• Domination game: extremal families of graphs for \(3/5\)-conjectures
• Extremal problems for game domination number
• Graph theory
• scientific article; zbMATH DE number 1934392 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees
• Matching theory
• Minimal dominating sets of cardinality two in a graph
• On the game domination number of graphs with given minimum degree
• Realizations of the game domination number
• The 4/5 upper bound on the game total domination number
• The connectivity of domination dot-critical graphs with no critical vertices
• The domination game played on unions of graphs
• Total version of the domination game
• Upper bounds on the diameter of domination dot-critical graphs with given connectivity
• Vertex domination-critical graphs

Cited in

(25)

• The 4/5 upper bound on the game total domination number
• Infinite families of circular and Möbius ladders that are total domination game critical
• Cutting lemma and union lemma for the domination game
• Effect of predomination and vertex removal on the game total domination number of a graph
• Domination game on uniform hypergraphs
• On graphs with largest possible game domination number
• Game total domination critical graphs
• On domination game stable graphs and domination game edge-critical graphs
• On game chromatic vertex-critical graphs
• Predominating a vertex in the connected domination game
• Z-domination game
• Game total domination for cyclic bipartite graphs
• Trees with equal total domination and game total domination numbers
• Progress towards the total domination game \(\frac{3}{4}\)-conjecture
• Game total domination for cycles and paths
• Complexity of the game domination problem
• Power contamination and domination on the grid
• Connected domination game
• Domination game on powers of cycles
• How long can one bluff in the domination game?
• Domination game: extremal families for the 3/5-conjecture for forests
• Paired-domination game played in graphs
• Connected domination game: predomination, Staller-start game, and lexicographic products
• Maker-Breaker domination game critical graphs
• Criticality for maker-breaker domination games with predomination

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)