On the game domination number of graphs with given minimum degree

From MaRDI portal
Publication:888585

zbMath1323.05087arXiv1406.7372MaRDI QIDQ888585

Csilla Bujtás

Publication date: 2 November 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.7372




Related Items (32)

The game total domination problem is log-complete in PSPACEGame total domination for cycles and pathsFast winning strategies for the maker-breaker domination gameThe 3/5-conjecture for weakly \(S(K_{1, 3})\)-free forestsOn the game total domination numberComplexity of the game domination problemMycielskian of graphs with small game domination numberDomination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least TwoMaker-breaker total domination gameDomination game critical graphsGeneral upper bound on the game domination numberInfinite families of circular and Möbius ladders that are total domination game criticalUnnamed ItemDomination game and minimal edge cutsCutting lemma and union lemma for the domination gameDomination game on uniform hypergraphsBounds on the 2-domination numberOn graphs with largest possible game domination numberThe enclaveless competition gameTotal connected domination gameHow long can one bluff in the domination game?The variety of domination gamesGame total domination critical graphsOn domination game stable graphs and domination game edge-critical graphsAn Introduction to Game Domination in GraphsGame total domination for cyclic bipartite graphs\( 1 / 2\)-conjectures on the domination game and claw-free graphsMaker-breaker domination numberFractional domination gameOn Rall's 1/2-conjecture on the domination gameConnected domination gameThe domination game played on diameter 2 graphs



Cites Work


This page was built for publication: On the game domination number of graphs with given minimum degree