A game of cops and robbers
From MaRDI portal
Publication:793755
DOI10.1016/0166-218X(84)90073-8zbMATH Open0539.05052OpenAlexW2046635105MaRDI QIDQ793755FDOQ793755
Publication date: 1984
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(84)90073-8
Recommendations
Games on graphs (graph-theoretic aspects) (05C57) Structural characterization of families of graphs (05C75) Positional games (pursuit and evasion, etc.) (91A24)
Cites Work
Cited In (only showing first 100 items - show all)
- General cops and robbers games with randomness
- Study of a combinatorial game in graphs through linear programming
- A simple approach for lower-bounding the distortion in any hyperbolic embedding
- The game of cops and robbers on directed graphs with forbidden subgraphs
- The optimal capture time of the one-cop-moves game
- An extension of a fixed point problem for simple graphs
- On the cop number of generalized Petersen graphs
- Vertex Pursuit Games in Stochastic Network Models
- Isometric-path numbers of block graphs
- On a pursuit game on Cayley digraphs
- Localization game on geometric and planar graphs
- On strict (outer-)confluent graphs
- Comparing the power of cops to zombies in pursuit-evasion games
- The capture time of a planar graph
- Spy-game on graphs: complexity and simple topologies
- A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity
- The median game
- Throttling for the game of cops and robbers on graphs
- A two-person game on graphs where each player tries to encircle his opponent's men
- Fine-grained Lower Bounds on Cops and Robbers
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems
- The lion and man game on polyhedral surfaces with obstacles
- Conjectures on Cops and Robbers
- Chasing robbers on random geometric graphs-an alternative approach
- Visibility graphs, dismantlability, and the cops and robbers game
- Cops and robbers on intersection graphs
- How many ants does it take to find the food?
- The capture time of the hypercube
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs
- A note on the cops and robber game on graphs embedded in non-orientable surfaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linguistic geometry approach for solving the cops and robber problem in grid environments
- On Strict (Outer-)Confluent Graphs
- The game of overprescribed Cops and Robbers played on graphs
- Isometric path numbers of graphs
- On the generalised colouring numbers of graphs that exclude a fixed minor
- Finding cut-vertices in the square roots of a graph
- Escaping offline searchers and isoperimetric theorems
- On a characterization of evasion strategies for pursuit-evasion games on graphs
- Bounds for cops and robber pursuit
- On Colourability of Polygon Visibility Graphs
- On the Capture Time of Cops and Robbers Game on a Planar Graph
- On a contraction-like property of dismantlable graphs
- A simple method for proving lower bounds in the zero-visibility cops and robber game
- Search and sweep numbers of finite directed acyclic graphs
- Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond
- Zero-visibility cops and robber and the pathwidth of a graph
- The impact of loops on the game of cops and robbers on graphs
- Edge-critical cops and robber in planar graphs
- \(k\)-capture in multiagent pursuit evasion, or the lion and the hyenas
- Reasoning About Strategies
- Cop-robber guarding game with cycle robber-region
- Guard games on graphs: keep the intruder out!
- How to guard a graph?
- The complexity of pursuit on a graph
- To catch a falling robber
- The role of information in the cop-robber game
- The pebbling threshold of the square of cliques
- Pursuing a fast robber on a graph
- Characterizations of \(k\)-copwin graphs
- A Leapfrog Strategy for Pursuit-Evasion in a Polygonal Environment
- The game of cops and eternal robbers
- Almost all cop-win graphs contain a universal vertex
- Almost all \(k\)-cop-win graphs contain a dominating set of cardinality \(k\)
- An annotated bibliography on guaranteed graph searching
- Cops and robbers on graphs based on designs
- Safe navigation in adversarial environments
- Cops and robbers in graphs with large girth and Cayley graphs
- Large classes of infinite k-cop-win graphs
- A proof of the Meyniel conjecture for abelian Cayley graphs
- A cop-winning strategy on strongly cop-win graphs
- Subdivisions in the robber locating game
- Some pursuit-evasion problems on grids
- Some results about pursuit games on metric spaces obtained through graph theory techniques
- Data center interconnection networks are not hyperbolic
- On a pursuit game on Cayley graphs
- On the cop number of toroidal graphs
- On a game of policemen and robber
- Hyperopic cops and robbers
- On cop-win graphs
- Title not available (Why is that?)
- Some remarks on cops and drunk robbers
- Cops and robbers is EXPTIME-complete
- A cops and robber game in multidimensional grids
- Cooperative pursuit with Voronoi partitions
- A deterministic version of the game of zombies and survivors on graphs
- Parameterized pursuit-evasion games
- Bounds on the length of a game of cops and robbers
- Cops and an insightful robber
- Variations of cops and robbers game on grids
- Note on a pursuit game played on graphs
- Cops and robber on butterflies and solid grids
- Cops, robber and traps
- Cop-Robber Guarding Game with Cycle Robber Region
- Coarse geometry of the cops and robber game
- 4-cop-win graphs have at least 19 vertices
- Cops and robber game without recharging
- Tandem-win graphs
- The damage throttling number of a graph
This page was built for publication: A game of cops and robbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q793755)
