The following pages link to A game of cops and robbers (Q793755):
Displaying 50 items.
- To catch a falling robber (Q265090) (← links)
- Data center interconnection networks are not hyperbolic (Q301597) (← links)
- Cooperative pursuit with Voronoi partitions (Q311899) (← links)
- A deterministic version of the game of zombies and survivors on graphs (Q313777) (← links)
- A probabilistic version of the game of zombies and survivors on graphs (Q343921) (← links)
- An evasion game on a graph (Q383337) (← links)
- The guarding game is E-complete (Q389949) (← links)
- \(k\)-capture in multiagent pursuit evasion, or the lion and the hyenas (Q393889) (← links)
- Characterizations of \(k\)-copwin graphs (Q408176) (← 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)
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802) (← links)
- The robber locating game (Q501037) (← links)
- Lazy Cops and Robbers on generalized hypercubes (Q526267) (← links)
- The game of Cops and Robber on circulant graphs (Q528556) (← links)
- A cops and robber game in multidimensional grids (Q602750) (← links)
- Cops and robbers from a distance (Q604465) (← links)
- Parameterized pursuit-evasion games (Q604466) (← links)
- Cop-robber guarding game with cycle robber-region (Q620952) (← links)
- Guard games on graphs: keep the intruder out! (Q650877) (← links)
- How to guard a graph? (Q652526) (← links)
- The complexity of pursuit on a graph (Q673639) (← links)
- An extension of a fixed point problem for simple graphs (Q686510) (← links)
- Cops and robber game without recharging (Q692888) (← links)
- Safe navigation in adversarial environments (Q723641) (← links)
- Throttling for the game of cops and robbers on graphs (Q724850) (← links)
- Bounds on the length of a game of cops and robbers (Q724868) (← links)
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems (Q729822) (← 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)
- Note on a pursuit game played on graphs (Q799702) (← links)
- General cops and robbers games with randomness (Q820532) (← links)
- Cops and robber on butterflies and solid grids (Q831728) (← links)
- Isometric-path numbers of block graphs (Q835002) (← links)
- How many ants does it take to find the food? (Q896147) (← links)
- The role of information in the cop-robber game (Q930890) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- The pebbling threshold of the square of cliques (Q941367) (← links)
- Escaping offline searchers and isoperimetric theorems (Q955225) (← links)
- Bounds for cops and robber pursuit (Q991186) (← links)
- A short note about pursuit games played on a graph with a given genus (Q1072462) (← links)
- On a pursuit game on Cayley graphs (Q1090336) (← links)
- Cops and robbers in graphs with large girth and Cayley graphs (Q1092060) (← links)
- On a pursuit game on Cayley digraphs (Q1100216) (← links)
- On a pursuit game played on graphs for which a minor is excluded (Q1101027) (← links)
- Some pursuit-evasion problems on grids (Q1199947) (← links)
- Search and sweep numbers of finite directed acyclic graphs (Q1208460) (← links)
- A two-person game on graphs where each player tries to encircle his opponent's men (Q1285593) (← links)
- Helicopter search problems, bandwidth and pathwidth (Q1392549) (← links)
