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)
- \(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
- A note on \(k\)-cop, \(l\)-robber games on graphs
- Cops and robber game without recharging
- Tandem-win graphs
- The damage throttling number of a graph
- Meyniel's conjecture holds for random graphs
- A probabilistic version of the game of zombies and survivors on graphs
- Variations on cops and robbers
- On Meyniel's conjecture of the cop number
- Lazy Cops and Robbers on Hypercubes
- Cops and Robbers on diameter two graphs
- Control Sequencing in a Game of Identity Pursuit-Evasion
- Chasing robbers on random graphs: Zigzag theorem
- A game of cops and robbers played on products of graphs
- Cops and robbers from a distance
- Smarter Lions: Efficient Cooperative Pursuit in General Bounded Arenas
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth
- The robber locating game
- A short note about pursuit games played on a graph with a given genus
- On a pursuit game played on graphs for which a minor is excluded
- An evasion game on a graph
- Chasing a Fast Robber on Planar Graphs and Random Graphs
- Title not available (Why is that?)
- To satisfy impatient web surfers is hard
- Helicopter search problems, bandwidth and pathwidth
- Lazy Cops and Robbers on generalized hypercubes
- The game of Cops and Robber on circulant graphs
- The guarding game is E-complete
- 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
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)
