The following pages link to (Q3565878):
Displaying 10 items.
- A probabilistic version of the game of zombies and survivors on graphs (Q343921) (← links)
- Cops and invisible robbers: the cost of drunkenness (Q385064) (← links)
- Almost all cop-win graphs contain a universal vertex (Q418869) (← links)
- Almost all \(k\)-cop-win graphs contain a dominating set of cardinality \(k\) (Q468433) (← links)
- Cops and Robbers on diameter two graphs (Q482211) (← links)
- Cops and robbers from a distance (Q604465) (← links)
- Throttling for the game of cops and robbers on graphs (Q724850) (← links)
- Chasing robbers on random geometric graphs-an alternative approach (Q741544) (← links)
- Fine-grained Lower Bounds on Cops and Robbers (Q5009566) (← links)
- The localization number of designs (Q6188118) (← links)
