The game of cops and robbers on graphs
From MaRDI portal
Publication:3090934
complexitygraph algorithmscops and robber gamesrandom graphsinfinite graphsgames on graphs, random graphs
Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) 2-person games (91A05) Games on graphs (graph-theoretic aspects) (05C57) Infinite graphs (05C63) Structural characterization of families of graphs (05C75) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to game theory, economics, and finance (91-01) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)
Recommendations
- An invitation to pursuit-evasion games and graph theory
- scientific article; zbMATH DE number 5241699
- A game of cops and robbers played on products of graphs
- Games on Graphs: Cop and Robber, Hungry Spiders, and Broadcast Domination
- A survey on the relationship between the game of cops and robbers and other game representations
Cited in
(only showing first 100 items - show all)- General cops and robbers games with randomness
- Lazy cops and robbers on hypercubes
- The one-cop-moves game on graphs with some special structures
- Study of a combinatorial game in graphs through linear programming
- Burning number of theta graphs
- Cup stacking in graphs
- Study of a combinatorial game in graphs through linear programming
- Computability and the game of cops and robbers on graphs
- Cops, a fast robber and defensive domination on interval graphs
- An application of the Gyárfás path argument
- The optimal capture time of the one-cop-moves game
- To catch a falling robber
- Cop vs. gambler
- Evacuating equilateral triangles and squares in the face-to-face model
- On the cop number of generalized Petersen graphs
- Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract)
- scientific article; zbMATH DE number 7700570 (Why is no real title available?)
- CADbots: algorithmic aspects of manipulating programmable matter with finite automata
- Cops and Robbers on Planar‐Directed Graphs
- Containment game played on random graphs: another zig-zag theorem
- Localization game on geometric and planar graphs
- Guarding isometric subgraphs and cops and robber in planar graphs
- The zero-visibility cops and robber game on graph products
- A cop and robber game on edge-periodic temporal graphs
- Treasure evacuation with one robot on a disk
- The game of cops and eternal robbers
- scientific article; zbMATH DE number 7720718 (Why is no real title available?)
- Cops and robber on butterflies, grids, and AT-free graphs
- Revolutionaries and Spies on Random Graphs
- A paradox for expected hitting times
- The localization game on oriented graphs
- Almost all cop-win graphs contain a universal vertex
- Meyniel extremal families of abelian Cayley graphs
- Pebble guided near optimal treasure hunt in anonymous graphs
- The localization capture time of a graph
- Almost all \(k\)-cop-win graphs contain a dominating set of cardinality \(k\)
- The damage number of the Cartesian product of graphs
- Primal-dual cops and robber
- Cops \& robber on periodic temporal graphs: characterization and improved bounds
- A tight lower bound for the capture time of the cops and robbers game
- A survey of graph burning
- Deterministic treasure hunt in the plane with angular hints
- An invitation to pursuit-evasion games and graph theory
- Searching for a Non-adversarial, Uncooperative Agent on a Cycle
- 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 graphs based on designs
- Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
- Locating a backtracking robber on a tree
- Cops and Robbers on Dynamic Graphs: Offline and Online Case
- Spy-game on graphs: complexity and simple topologies
- Cops and Robbers on Graphs of Bounded Diameter
- Games on Graphs: Cop and Robber, Hungry Spiders, and Broadcast Domination
- Throttling for the game of cops and robbers on graphs
- Forming tile shapes with simple robots
- Game with Slow Pursuers on the Edge Graphs of Regular Simplexes
- Differential Game with Slow Pursuers on the Edge Graph of a Simplex
- Graph searching games and probabilistic methods
- A robber locating strategy for trees
- Fast searching on complete \(k\)-partite graphs
- Fast searching on Cartesian products of graphs
- How to Burn a Graph
- Fundamental groupoids for graphs
- Vertex-edge domination in graphs
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems
- Cops and invisible robbers: the cost of drunkenness
- Selfish cops and active robber: multi-player pursuit evasion on graphs
- On the cop number of toroidal graphs
- Cops and robber game in higher-dimensional manifolds with spherical and Euclidean metric
- Fine-grained Lower Bounds on Cops and Robbers
- Improved bounds on the cop number of a graph drawn on a surface
- Zero-visibility cops and robber game on cage graph
- Centroidal localization game
- Toward multi-target self-organizing pursuit in a partially observable Markov game
- Hyperopic cops and robbers
- Searching for a non-adversarial, uncooperative agent on a cycle
- The complexity of zero-visibility cops and robber
- Some remarks on cops and drunk robbers
- Cops and robbers is EXPTIME-complete
- On the conjecture of the smallest 3-cop-win planar graph
- A cops and robber game in multidimensional grids
- Most generalized Petersen graphs of girth 8 have cop number 4
- A deterministic version of the game of zombies and survivors on graphs
- A note on \(k\)-cop-win graphs
- On the subtle nature of a simple logic of the hide and seek game
- Computing the one-visibility cop-win strategies for trees
- Bounds on the length of a game of cops and robbers
- A note on deterministic zombies
- The complexity of growing a graph
- Cops and an insightful robber
- Chasing robbers on random geometric graphs-an alternative approach
- Cops and robber on butterflies and solid grids
- Cops and robbers on 1-planar graphs
- Variations of cops and robbers game on grids
- Visibility graphs, dismantlability, and the cops and robbers game
- scientific article; zbMATH DE number 7561402 (Why is no real title available?)
- Computing the one-visibility copnumber of trees
- Capture-time extremal cop-win graphs
- 4-cop-win graphs have at least 19 vertices
- Coarse geometry of the cops and robber game
This page was built for publication: The game of cops and robbers on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3090934)
