A strategy for isolator in the toucher-isolator game on trees
From MaRDI portal
(Redirected from Publication:2064906)
Abstract: In the Toucher-Isolator game, introduced recently by Dowden, Kang, Mikalav{c}ki and Stojakovi'{c}, Toucher and Isolator alternately claim an edge from a graph such that Toucher aims to touch as many vertices as possible, while Isolator aims to isolate as many vertices as possible, where Toucher plays first. Among trees with vertices, they showed that the star is the best choice for Isolator and they asked for the most suitable tree for Toucher. Later, R"{a}ty showed that the answer is the path with vertices. We give a simple alternative proof of this result. The method to determine where Isolator should play is by breaking down the gains and losses in each move of both players.
Recommendations
Cites work
- An Achievement Game on a Cycle
- Fast strategies in biased Maker-Breaker games
- Fast winning strategies in maker-breaker games
- Maker-breaker domination number
- Maker-breaker total domination game
- On a combinatorial game
- On the Chvàtal-Erdős triangle game
- On the clique-game
- On the WalkerMaker-WalkerBreaker games
- The critical bias for the Hamiltonicity game is (1+𝑜(1))𝑛/ln𝑛
- The toucher-isolator game
- Walker-breaker games
This page was built for publication: A strategy for isolator in the toucher-isolator game on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2064906)