The domination game played on unions of graphs

From MaRDI portal
Publication:468438

DOI10.1016/j.disc.2014.08.024zbMath1302.05117OpenAlexW2075805173MaRDI QIDQ468438

Gašper Košmrlj, Gabriel Renault, Paul Dorbec

Publication date: 7 November 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.08.024




Related Items (48)

Trees with equal total domination and game total domination numbersTotal dominating sequences in graphsThe game total domination problem is log-complete in PSPACEThe disjoint domination gameThe graph distance game and some graph operationsGame total domination for cycles and pathsFast winning strategies for the maker-breaker domination gameProgress towards the total domination game \(\frac{3}{4}\)-conjectureThe 3/5-conjecture for weakly \(S(K_{1, 3})\)-free forestsComplexity of the game domination problemMycielskian of graphs with small game domination numberCharacterisation of forests with trivial game domination numbersPaired-Domination Game Played in GraphsPerfect graphs for domination gamesOn the game domination number of graphs with given minimum degreeMaker-breaker total domination gameMaker-Breaker total domination game on cubic graphsUnnamed ItemDomination game critical graphsGeneral upper bound on the game domination numberThe 4/5 upper bound on the game total domination numberUnnamed ItemTHE DOMINATION GAME ON SPLIT GRAPHSDomination game and minimal edge cutsCutting lemma and union lemma for the domination gameEffect of predomination and vertex removal on the game total domination number of a graphDomination game on uniform hypergraphsTotal version of the domination gameOn graphs with largest possible game domination numberTotal connected domination gameHow long can one bluff in the domination game?Domination game: extremal families for the 3/5-conjecture for forestsThe variety of domination gamesDominating sets reconfiguration under token slidingGame domination numbers of a disjoint union of paths and cyclesGame total domination critical graphsAn Introduction to Game Domination in GraphsUnnamed Item\( 1 / 2\)-conjectures on the domination game and claw-free graphsEffect of vertex-removal on game total domination numbersEffect of an edge subdivision on game domination numbersMaker-breaker domination numberMaker-Breaker domination gameFractional domination gameOn Rall's 1/2-conjecture on the domination gameConnected domination game played on Cartesian productsConnected domination gameThe domination game played on diameter 2 graphs



Cites Work


This page was built for publication: The domination game played on unions of graphs