The following pages link to The capture time of a graph (Q1045043):
Displayed 16 items.
- Cop vs. gambler (Q267177) (← links)
- Pursuit evasion on infinite graphs (Q343924) (← links)
- Capturing the drunk robber on a graph (Q406701) (← links)
- Cops and robbers ordinals of cop-win trees (Q512565) (← links)
- The capture time of grids (Q616367) (← links)
- Fast edge searching and fast searching on graphs (Q631784) (← links)
- 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)
- Cop-win graphs with maximum capture-time (Q968433) (← links)
- Visibility graphs, dismantlability, and the cops and robbers game (Q1693315) (← links)
- The capture time of the hypercube (Q1953506) (← 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)
- Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond (Q3460727) (← links)
- Conjectures on Cops and Robbers (Q5506774) (← links)