Cops and robber on butterflies and solid grids
From MaRDI portal
Publication:831728
DOI10.1007/978-3-030-67899-9_21OpenAlexW3128379725MaRDI QIDQ831728
Sandip Das, Harmender Gahlawat, Sheikh Shakil Akhtar
Publication date: 24 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-67899-9_21
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The capture time of grids
- The complexity of pursuit on a graph
- A game of cops and robbers
- Graph searching and a min-max theorem for tree-width
- On the cop number of a graph
- Game of cops and robbers in oriented quotients of the integer grid
- On a game of policemen and robber
- Vertex-to-vertex pursuit in a graph
- Cops and robbers is EXPTIME-complete
- Pursuing a fast robber on a graph
- Catching a fast robber on the grid
- Randomized Pursuit-Evasion with Local Visibility
- Variations of cops and robbers game on grids
This page was built for publication: Cops and robber on butterflies and solid grids
