The following pages link to Cops and robbers from a distance (Q604465):
Displaying 19 items.
- A probabilistic version of the game of zombies and survivors on graphs (Q343921) (← links)
- Characterizations of \(k\)-copwin graphs (Q408176) (← links)
- The fast robber on interval and chordal graphs (Q476326) (← links)
- Spy-game on graphs: complexity and simple topologies (Q1748987) (← links)
- Cops and Robber game with a fast robber on expander graphs and random graphs (Q1929738) (← links)
- Study of a combinatorial game in graphs through linear programming (Q1986957) (← links)
- 4-cop-win graphs have at least 19 vertices (Q2032980) (← links)
- A survey on the relationship between the game of cops and robbers and other game representations (Q2280205) (← links)
- Cops, a fast robber and defensive domination on interval graphs (Q2328864) (← links)
- Containment game played on random graphs: another zig-zag theorem (Q2346471) (← links)
- To satisfy impatient web surfers is hard (Q2437758) (← links)
- Spy game: FPT-algorithm, hardness and graph products (Q2672629) (← links)
- Spy game: FPT-algorithm and results on graph products (Q2695339) (← links)
- Variations on cops and robbers (Q2891049) (← links)
- On Meyniel's conjecture of the cop number (Q2911063) (← links)
- Chasing a Fast Robber on Planar Graphs and Random Graphs (Q2940989) (← links)
- An Introduction to Lazy Cops and Robbers on Graphs (Q4581686) (← links)
- (Q5136239) (← links)
- Coarse geometry of the cops and robber game (Q6080533) (← links)
