The following pages link to A game of cops and robbers (Q793755):
Displaying 50 items.
- A two-person game on graphs where each player tries to encircle his opponent's men (Q1285593) (← links)
- On the cop number of a graph (Q1325748) (← links)
- Bridged graphs are cop-win graphs: An algorithmic proof (Q1354123) (← links)
- Helicopter search problems, bandwidth and pathwidth (Q1392549) (← links)
- A game of cops and robbers played on products of graphs (Q1584265) (← links)
- Localization game on geometric and planar graphs (Q1627842) (← links)
- The capture time of a planar graph (Q1631664) (← links)
- The lion and man game on polyhedral surfaces with obstacles (Q1643158) (← links)
- Cops and robbers on intersection graphs (Q1645059) (← links)
- On a characterization of evasion strategies for pursuit-evasion games on graphs (Q1686676) (← links)
- A simple approach for lower-bounding the distortion in any hyperbolic embedding (Q1689928) (← links)
- Visibility graphs, dismantlability, and the cops and robbers game (Q1693315) (← links)
- The impact of loops on the game of cops and robbers on graphs (Q1712543) (← links)
- Spy-game on graphs: complexity and simple topologies (Q1748987) (← links)
- The median game (Q1751121) (← links)
- On a game of policemen and robber (Q1820799) (← links)
- Some results about pursuit games on metric spaces obtained through graph theory techniques (Q1821043) (← links)
- On cop-win graphs (Q1850039) (← links)
- Some remarks on cops and drunk robbers (Q1929226) (← links)
- Cops and robbers in a random graph (Q1945995) (← links)
- The capture time of the hypercube (Q1953506) (← links)
- On the cop number of toroidal graphs (Q1984519) (← links)
- Study of a combinatorial game in graphs through linear programming (Q1986957) (← links)
- Comparing the power of cops to zombies in pursuit-evasion games (Q2009014) (← links)
- Edge-critical cops and robber in planar graphs (Q2017039) (← links)
- 4-cop-win graphs have at least 19 vertices (Q2032980) (← links)
- The game of cops and eternal robbers (Q2034413) (← links)
- Cops and robbers on directed and undirected abelian Cayley graphs (Q2048357) (← links)
- The one-cop-moves game on planar graphs (Q2051905) (← links)
- Ambush cops and robbers (Q2053707) (← links)
- Guarding a subgraph as a tool in pursuit-evasion games (Q2062677) (← links)
- Product throttling (Q2073191) (← links)
- A note on cops and robbers, independence number, domination number and diameter (Q2092403) (← links)
- Chasing a drunk robber in many classes of graphs (Q2105709) (← links)
- On a contraction-like property of dismantlable graphs (Q2112715) (← links)
- Meyniel extremal families of abelian Cayley graphs (Q2117525) (← links)
- The game of cops and robbers on directed graphs with forbidden subgraphs (Q2155657) (← links)
- A simple method for proving lower bounds in the zero-visibility cops and robber game (Q2156313) (← links)
- A faster algorithm for cops and robbers (Q2166209) (← links)
- Catching an infinitely fast robber on a grid (Q2166261) (← links)
- Containment: a variation of cops and robber (Q2175792) (← links)
- A tight lower bound for the capture time of the cops and robbers game (Q2196569) (← links)
- Edge degeneracy: algorithmic and structural results (Q2196572) (← links)
- Cops and robbers on graphs with a set of forbidden induced subgraphs (Q2196576) (← links)
- Cops that surround a robber (Q2197471) (← links)
- On strict (outer-)confluent graphs (Q2206846) (← links)
- On positionality of trigger strategies Nash equilibria in SCAR (Q2207502) (← links)
- The one-cop-moves game on graphs with some special structures (Q2210510) (← links)
- Cops and robbers on oriented toroidal grids (Q2220788) (← links)
- Cops and robbers on \(2K_2\)-free graphs (Q2237234) (← links)
