Infinite families of circular and Möbius ladders that are total domination game critical
type: Item
instance of: scholarly article
title: Infinite families of circular and Möbius ladders that are total domination game critical
zbMATH Open document ID: 1406.05069
author: Michael A. Henning
author: Sandi Klavžar
published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series
publication date: 2019-01-31T00:00:00Z
Mathematics Subject Classification ID: 05C57
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C76
zbMATH DE Number: 7008727
zbMATH Keywords: total domination game
zbMATH Keywords: game total domination number
zbMATH Keywords: critical graph
zbMATH Keywords: circular ladder
zbMATH Keywords: Möbius ladder
MaRDI profile type: Publication
full work available at URL: s40840-018-0635-8
OpenAlex ID: W2803252093
cites work: Complexity of the game domination problem
cites work: The game total domination problem is log-complete in PSPACE
cites work: Domination Game and an Imagination Strategy
cites work: On the game domination number of graphs with given minimum degree
cites work: Domination game critical graphs
cites work: Transversal game on hypergraphs and the \(\frac{3}{4}\)-conjecture on the total domination game
cites work: Game total domination for cycles and paths
cites work: Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two
cites work: Total version of the domination game
cites work: Q3005852
cites work: The 4/5 upper bound on the game total domination number
cites work: Game total domination critical graphs
cites work: Domination game: extremal families for the 3/5-conjecture for forests
cites work: Progress towards the total domination game \(\frac{3}{4}\)-conjecture
cites work: Trees with equal total domination and game total domination numbers
cites work: Total Domination in Graphs
cites work: The optimal rubbling number of ladders, prisms and Möbius-ladders
cites work: Extremal Problems for Game Domination Number
cites work: Realizations of the game domination number
cites work: Characterisation of forests with trivial game domination numbers
cites work: The 3/5-conjecture for weakly \(S(K_{1, 3})\)-free forests
DOI: 10.1007/S40840-018-0635-8
description: scientific article; zbMATH DE number 7008727