Catching an infinitely fast robber on a grid
From MaRDI portal
Publication:2166261
DOI10.1016/j.dam.2022.06.022zbMath1495.05190arXiv2107.14193OpenAlexW4283658014MaRDI QIDQ2166261
Nikolas Townsend, William B. Kinnersley
Publication date: 24 August 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2107.14193
Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Unnamed Item
- Unnamed Item
- The fast robber on interval and chordal graphs
- Bandwidth and pathwidth of three-dimensional grids
- On a generalization of Meyniel's conjecture on the Cops and Robbers game
- Some inequalities relating to the partial sum of binomial probabilities
- A game of cops and robbers
- Compressions and isoperimetric inequalities
- On a game of policemen and robber
- Vertex-to-vertex pursuit in a graph
- Cops and Robber game with a fast robber on expander graphs and random graphs
- Pursuing a fast robber on a graph
- Cops, a fast robber and defensive domination on interval graphs
- Catching a fast robber on the grid
- Variations on cops and robbers
- Chasing a Fast Robber on Planar Graphs and Random Graphs
- Lazy Cops and Robbers on Hypercubes
- Optimal numberings and isoperimetric problems on graphs
This page was built for publication: Catching an infinitely fast robber on a grid
