The following pages link to (Q5445040):
Displaying 34 items.
- Almost all cop-win graphs contain a universal vertex (Q418869) (← links)
- The fast robber on interval and chordal graphs (Q476326) (← links)
- Cops and Robbers on diameter two graphs (Q482211) (← links)
- Cops and robbers ordinals of cop-win trees (Q512565) (← links)
- The fast search number of a Cartesian product of graphs (Q526821) (← links)
- Cops and robbers from a distance (Q604465) (← links)
- Parameterized pursuit-evasion games (Q604466) (← links)
- The capture time of grids (Q616367) (← links)
- Chasing robbers on random geometric graphs-an alternative approach (Q741544) (← links)
- Linguistic geometry approach for solving the cops and robber problem in grid environments (Q778399) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- The capture time of a graph (Q1045043) (← links)
- Visibility graphs, dismantlability, and the cops and robbers game (Q1693315) (← links)
- The median game (Q1751121) (← links)
- The fast search number of a complete \(k\)-partite graph (Q1799234) (← 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)
- A tight lower bound for the capture time of the cops and robbers game (Q2196569) (← links)
- The one-cop-moves game on graphs with some special structures (Q2210510) (← links)
- Pursuing a fast robber on a graph (Q2268876) (← links)
- A proof of the Meyniel conjecture for abelian Cayley graphs (Q2279260) (← links)
- The optimal capture time of the one-cop-moves game (Q2348264) (← links)
- Fast searching on cactus graphs (Q2696935) (← links)
- Security and Formation of Network-Centric Operations (Q2790429) (← links)
- Meyniel's conjecture holds for random graphs (Q2795750) (← 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)
- Fast Searching on Complete k-partite Graphs (Q2958311) (← links)
- Fast Searching on Cartesian Products of Graphs (Q2988858) (← links)
- Chasing robbers on random graphs: Zigzag theorem (Q3061185) (← links)
- Large classes of infinite k-cop-win graphs (Q3061192) (← links)
- Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond (Q3460727) (← links)
- Conjectures on Cops and Robbers (Q5506774) (← links)