A game of cops and robbers
From MaRDI portal
Publication:793755
DOI10.1016/0166-218X(84)90073-8zbMATH Open0539.05052OpenAlexW2046635105MaRDI QIDQ793755FDOQ793755
Authors: Martin Aigner, M. Fromme 
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)
- The one-cop-moves game on graphs with some special structures
- Cops and robbers on \(2K_2\)-free graphs
- Study of a combinatorial game in graphs through linear programming
- Study of a combinatorial game in graphs through linear programming
- An application of the Gyárfás path argument
- The game of cops and robbers on directed graphs with forbidden subgraphs
- Title not available (Why is that?)
- Chasing a drunk robber in many classes of graphs
- Fast Robber in Planar Graphs
- Meyniel extremal families of abelian Cayley graphs
- A tight lower bound for the capture time of the cops and robbers game
- Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
- Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
- Comparing the power of cops to zombies in pursuit-evasion games
- Cops and Robbers on Dynamic Graphs: Offline and Online Case
- Spy-game on graphs: complexity and simple topologies
- The median game
- On the conjecture of the smallest 3-cop-win planar graph
- The cops and robber game on graphs with forbidden (induced) subgraphs
- Cops and robbers on directed and undirected abelian Cayley graphs
- A faster algorithm for cops and robbers
- Catching an infinitely fast robber on a grid
- The one-cop-moves game on planar graphs
- Containment: a variation of cops and robber
- Cops and robber on some families of oriented graphs
- A uniform betweenness property in metric spaces and its role in the quantitative analysis of the ``lion-man game
- Guarding a subgraph as a tool in pursuit-evasion games
- An introduction to lazy cops and robbers on graphs
- A note on hyperopic cops and robber
- A survey on the relationship between the game of cops and robbers and other game representations
- Product throttling
- Pursuit evasion on polyhedral surfaces
- Cops and robbers on graphs with a set of forbidden induced subgraphs
- Edge degeneracy: algorithmic and structural results
- Cops that surround a robber
- The cop number of the one-cop-moves game on planar graphs
- The impact of loops on the game of cops and robbers on graphs
- On positionality of trigger strategies Nash equilibria in SCAR
- Fully active cops and robbers
- A note on cops and robbers, independence number, domination number and diameter
- A game of cops and robbers on graphs with periodic edge-connectivity
- \(k\)-capture in multiagent pursuit evasion, or the lion and the hyenas
- 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
- Smarter Lions: efficient cooperative pursuit in general bounded arenas
- Characterizations of \(k\)-copwin graphs
- The game of cops and eternal robbers
- Cops and robbers playing on edges
- 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
- 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
- Chasing robbers on random graphs: zigzag theorem
- 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?)
- Gromov hyperbolicity and cop and robber game
- Some remarks on cops and drunk robbers
- Cops and robbers is EXPTIME-complete
- Cops and robbers in a random graph
- Cooperative pursuit with Voronoi partitions
- A deterministic version of the game of zombies and survivors on graphs
- Parameterized pursuit-evasion games
- Cops and an insightful robber
- Cops, robber and traps
- 4-cop-win graphs have at least 19 vertices
- A note on \(k\)-cop, \(l\)-robber games on graphs
- Tandem-win graphs
- The damage throttling number of a graph
- Chasing a fast robber on planar graphs and random graphs
- Meyniel's conjecture holds for random graphs
- A probabilistic version of the game of zombies and survivors on graphs
- Pursuit evasion on infinite graphs
- Variations on cops and robbers
- On Meyniel's conjecture of the cop number
- Cops and Robbers on diameter two graphs
- Cop and robber games when the robber can hide and ride
- A game of cops and robbers played on products of graphs
- Cops and robbers from a distance
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth
- Reasoning about strategies: on the model-checking problem
- A leapfrog strategy for pursuit-evasion in a polygonal environment
- Cops and robbers on oriented toroidal grids
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)
