The following pages link to On a game of policemen and robber (Q1820799):
Displaying 22 items.
- To catch a falling robber (Q265090) (← links)
- A deterministic version of the game of zombies and survivors on graphs (Q313777) (← links)
- A probabilistic version of the game of zombies and survivors on graphs (Q343921) (← links)
- The complexity of pursuit on a graph (Q673639) (← links)
- Cops and robber on butterflies and solid grids (Q831728) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Escaping offline searchers and isoperimetric theorems (Q955225) (← links)
- On a pursuit game on Cayley graphs (Q1090336) (← links)
- Some pursuit-evasion problems on grids (Q1199947) (← links)
- A game of cops and robbers played on products of graphs (Q1584265) (← links)
- The capture time of the hypercube (Q1953506) (← links)
- Comparing the power of cops to zombies in pursuit-evasion games (Q2009014) (← links)
- Catching an infinitely fast robber on a grid (Q2166261) (← links)
- Containment: a variation of cops and robber (Q2175792) (← links)
- The one-cop-moves game on graphs with some special structures (Q2210510) (← links)
- Pursuing a fast robber on a graph (Q2268876) (← links)
- A proof of the Meyniel conjecture for abelian Cayley graphs (Q2279260) (← links)
- Catching a fast robber on the grid (Q2401986) (← links)
- The game of overprescribed Cops and Robbers played on graphs (Q2409518) (← links)
- Variations on cops and robbers (Q2891049) (← links)
- An Introduction to Lazy Cops and Robbers on Graphs (Q4581686) (← links)
- Cops and robber on butterflies, grids, and AT-free graphs (Q6145827) (← links)
