The following pages link to (Q3565878):
Displaying 23 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)
- Cops and robbers on intersection graphs (Q1645059) (← links)
- Some remarks on cops and drunk robbers (Q1929226) (← links)
- Cops and Robber game with a fast robber on expander graphs and random graphs (Q1929738) (← links)
- Cops and robbers on directed and undirected abelian Cayley graphs (Q2048357) (← links)
- A note on cops and robbers, independence number, domination number and diameter (Q2092403) (← links)
- Meyniel extremal families of abelian Cayley graphs (Q2117525) (← links)
- A tight lower bound for the capture time of the cops and robbers game (Q2196569) (← links)
- Cops that surround a robber (Q2197471) (← links)
- Containment game played on random graphs: another zig-zag theorem (Q2346471) (← links)
- The optimal capture time of the one-cop-moves game (Q2348264) (← links)
- Meyniel's conjecture holds for random graphs (Q2795750) (← links)
- Cops and Robbers on Graphs Based on Designs (Q2864796) (← links)
- Chasing a Fast Robber on Planar Graphs and Random Graphs (Q2940989) (← links)
- Fine-grained Lower Bounds on Cops and Robbers (Q5009566) (← links)
- The localization number of designs (Q6188118) (← links)
