Pages that link to "Item:Q625381"
From MaRDI portal
The following pages link to On a generalization of Meyniel's conjecture on the Cops and Robbers game (Q625381):
Displaying 9 items.
- Chasing robbers on random geometric graphs-an alternative approach (Q741544) (← links)
- Spy-game on graphs: complexity and simple topologies (Q1748987) (← links)
- Catching an infinitely fast robber on a grid (Q2166261) (← links)
- Cops, a fast robber and defensive domination on interval graphs (Q2328864) (← links)
- Catching a fast robber on the grid (Q2401986) (← 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)
- Chasing a Fast Robber on Planar Graphs and Random Graphs (Q2940989) (← links)
