The following pages link to A game of cops and robbers (Q793755):
Displaying 50 items.
- Cops and robbers is EXPTIME-complete (Q2259861) (← links)
- Pursuing a fast robber on a graph (Q2268876) (← links)
- A proof of the Meyniel conjecture for abelian Cayley graphs (Q2279260) (← links)
- A survey on the relationship between the game of cops and robbers and other game representations (Q2280205) (← links)
- An application of the Gyárfás path argument (Q2319714) (← links)
- Hyperopic cops and robbers (Q2328865) (← links)
- Zero-visibility cops and robber and the pathwidth of a graph (Q2343977) (← links)
- The optimal capture time of the one-cop-moves game (Q2348264) (← links)
- On the cop number of generalized Petersen graphs (Q2400572) (← links)
- The game of overprescribed Cops and Robbers played on graphs (Q2409518) (← links)
- A note on \(k\)-cop, \(l\)-robber games on graphs (Q2433710) (← links)
- To satisfy impatient web surfers is hard (Q2437758) (← links)
- A note on the cops and robber game on graphs embedded in non-orientable surfaces (Q2441345) (← links)
- Cops and robbers playing on edges (Q2448255) (← links)
- Isometric path numbers of graphs (Q2501546) (← links)
- Tandem-win graphs (Q2568474) (← links)
- Subdivisions in the robber locating game (Q2629293) (← links)
- A uniform betweenness property in metric spaces and its role in the quantitative analysis of the ``lion-man'' game (Q2658486) (← links)
- Cops and an insightful robber (Q2661223) (← links)
- Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs (Q2672445) (← links)
- Spy game: FPT-algorithm, hardness and graph products (Q2672629) (← links)
- Spy game: FPT-algorithm and results on graph products (Q2695339) (← links)
- Cops and robber on subclasses of \(P_5\)-free graphs (Q2699919) (← links)
- Cops, robber and traps (Q2770438) (← links)
- Security and Formation of Network-Centric Operations (Q2790429) (← links)
- Meyniel's conjecture holds for random graphs (Q2795750) (← links)
- Cops and robbers on graphs based on designs (Q2864796) (← 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)
- Reasoning About Strategies (Q2946746) (← links)
- On the Capture Time of Cops and Robbers Game on a Planar Graph (Q2958299) (← links)
- On the Conjecture of the Smallest 3-Cop-Win Planar Graph (Q2988846) (← links)
- Chasing robbers on random graphs: Zigzag theorem (Q3061185) (← links)
- Large classes of infinite k-cop-win graphs (Q3061192) (← links)
- A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity (Q3297755) (← links)
- (Q3305770) (← links)
- A Leapfrog Strategy for Pursuit-Evasion in a Polygonal Environment (Q3449119) (← links)
- Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond (Q3460727) (← links)
- (Q3798505) (← links)
- An Introduction to Lazy Cops and Robbers on Graphs (Q4581686) (← links)
- (Q4614817) (← links)
- (Q4677834) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- The damage throttling number of a graph (Q5000318) (← links)
- Fine-grained Lower Bounds on Cops and Robbers (Q5009566) (← links)
- On generalised Petersen graphs of girth 7 that have cop number 4 (Q5045260) (← links)
- TIPSY COP AND DRUNKEN ROBBER: A VARIANT OF THE COP AND ROBBER GAME ON GRAPHS (Q5076122) (← links)
- On Strict (Outer-)Confluent Graphs (Q5084690) (← links)
- Model-Free Reinforcement Learning for Stochastic Parity Games (Q5089286) (← links)
