Total connected domination game
From MaRDI portal
Publication:5161631
DOI10.7494/OpMath.2021.41.4.453zbMath1476.05135arXiv2010.04907OpenAlexW3182234687MaRDI QIDQ5161631
Csilla Bujtás, Vesna Iršič, Michael A. Henning, Sandi Klavžar
Publication date: 1 November 2021
Published in: Opuscula Mathematica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.04907
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) Graph operations (line graphs, products, etc.) (05C76)
Related Items (1)
Cites Work
- Unnamed Item
- Game total domination for cycles and paths
- The domination game played on unions of graphs
- Total version of the domination game
- On the game domination number of graphs with given minimum degree
- On the game total domination number
- The 4/5 upper bound on the game total domination number
- Domination game and minimal edge cuts
- Effect of predomination and vertex removal on the game total domination number of a graph
- On domination game stable graphs and domination game edge-critical graphs
- Connected domination game played on Cartesian products
- The game total domination problem is log-complete in PSPACE
- Progress towards the total domination game \(\frac{3}{4}\)-conjecture
- Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs
- Domination Game and an Imagination Strategy
- THE DOMINATION GAME ON SPLIT GRAPHS
- Total Domination in Graphs
- Connected domination game
- Extremal Problems for Game Domination Number
This page was built for publication: Total connected domination game