Cops and robber on butterflies and solid grids
From MaRDI portal
Publication:831728
DOI10.1007/978-3-030-67899-9_21OpenAlexW3128379725MaRDI QIDQ831728FDOQ831728
Authors: Sheikh Shakil Akhtar, Sandip Das, Harmender Gahlawat 
Publication date: 24 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-67899-9_21
Cites Work
- Graph searching and a min-max theorem for tree-width
- On the cop number of a graph
- On a game of policemen and robber
- Vertex-to-vertex pursuit in a graph
- The game of cops and robbers on graphs
- Title not available (Why is that?)
- A game of cops and robbers
- Pursuing a fast robber on a graph
- Searching and sweeping graphs: a brief survey
- Randomized Pursuit-Evasion with Local Visibility
- Cops and robbers is EXPTIME-complete
- The complexity of pursuit on a graph
- Game of cops and robbers in oriented quotients of the integer grid
- Variations of cops and robbers game on grids
- The capture time of grids
- Catching a fast robber on the grid
Cited In (2)
This page was built for publication: Cops and robber on butterflies and solid grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831728)
