The following pages link to The capture time of grids (Q616367):
Displaying 17 items.
- Throttling for the game of cops and robbers on graphs (Q724850) (← links)
- Bounds on the length of a game of cops and robbers (Q724868) (← links)
- Linguistic geometry approach for solving the cops and robber problem in grid environments (Q778399) (← links)
- Cops and robber on butterflies and solid grids (Q831728) (← links)
- The capture time of a planar graph (Q1631664) (← links)
- Some remarks on cops and drunk robbers (Q1929226) (← links)
- The capture time of the hypercube (Q1953506) (← links)
- The game of cops and eternal robbers (Q2034413) (← links)
- Chasing a drunk robber in many classes of graphs (Q2105709) (← links)
- Capture times in the bridge-burning cops and robbers game (Q2142681) (← links)
- A tight lower bound for the capture time of the cops and robbers game (Q2196569) (← links)
- The optimal capture time of the one-cop-moves game (Q2348264) (← links)
- The game of overprescribed Cops and Robbers played on graphs (Q2409518) (← links)
- On the Capture Time of Cops and Robbers Game on a Planar Graph (Q2958299) (← links)
- Cops and Robbers on Geometric Graphs (Q3168443) (← links)
- Cops and robber on butterflies, grids, and AT-free graphs (Q6145827) (← links)
- Cops and robber game on infinite chessboard (Q6193779) (← links)
