The 4/5 upper bound on the game total domination number
From MaRDI portal
Publication:1705814
DOI10.1007/s00493-015-3316-3zbMath1399.05165OpenAlexW2342083085MaRDI QIDQ1705814
Sandi Klavžar, Douglas F. Rall, Michael A. Henning
Publication date: 16 March 2018
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-015-3316-3
Trees (05C05) 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 (30)
The game total domination problem is log-complete in PSPACE ⋮ On the game total domination number ⋮ Paired-Domination Game Played in Graphs ⋮ Total dominating sequences in trees, split graphs, and under modular decomposition ⋮ Perfect graphs for domination games ⋮ Maker-breaker total domination game ⋮ Domination game critical graphs ⋮ General upper bound on the game domination number ⋮ Z-domination game ⋮ Bounds for the competition-independence game on trees ⋮ Fast winning strategies for staller in the maker-breaker domination game ⋮ The matcher game played in graphs ⋮ Infinite families of circular and Möbius ladders that are total domination game critical ⋮ THE DOMINATION GAME ON SPLIT GRAPHS ⋮ Domination game and minimal edge cuts ⋮ 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 ⋮ Bounds on the 2-domination number ⋮ On graphs with largest possible game domination number ⋮ Total connected domination game ⋮ The variety of domination games ⋮ Game total domination critical graphs ⋮ An Introduction to Game Domination in Graphs ⋮ Game total domination for cyclic bipartite graphs ⋮ \( 1 / 2\)-conjectures on the domination game and claw-free graphs ⋮ Fractional domination game ⋮ Connected domination game: Predomination, Staller-start game, and lexicographic products ⋮ Connected domination game played on Cartesian products ⋮ The domination game played on diameter 2 graphs
Cites Work
- Unnamed Item
- The domination game played on unions of graphs
- Total version of the domination game
- Domination game critical graphs
- Domination game played on trees and spanning subgraphs
- 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 and an Imagination Strategy
- Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two
- Total Domination in Graphs
- Extremal Problems for Game Domination Number
This page was built for publication: The 4/5 upper bound on the game total domination number
