Cops and robbers ordinals of cop-win trees
From MaRDI portal
Publication:512565
DOI10.1016/j.disc.2016.12.019zbMath1357.05102arXiv1603.04266OpenAlexW2952034745MaRDI QIDQ512565
Anthony Bonato, Geňa Hahn, Przemysław Gordinowicz
Publication date: 27 February 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.04266
Trees (05C05) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57) Infinite graphs (05C63)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A deterministic version of the game of zombies and survivors on graphs
- A probabilistic version of the game of zombies and survivors on graphs
- Characterizations of \(k\)-copwin graphs
- The capture time of a graph
- Vertex-to-vertex pursuit in a graph
- Meyniel's conjecture on the cop number: a survey
- On infinite bridged graphs and strongly dismantlable graphs
- A note on \(k\)-cop, \(l\)-robber games on graphs
- Large classes of infinite k-cop-win graphs
- Characterizations and algorithms for generalized Cops and Robbers games
- WHAT IS...Cop Number?
This page was built for publication: Cops and robbers ordinals of cop-win trees