The game of cops and robbers on graphs
From MaRDI portal
Publication:3090934
zbMATH Open1298.91004MaRDI QIDQ3090934FDOQ3090934
Authors: Anthony Bonato, R. J. Nowakowski 
Publication date: 7 September 2011
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
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)
Cited In (only showing first 100 items - show all)
- Study of a combinatorial game in graphs through linear programming
- 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
- Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract)
- Evacuating equilateral triangles and squares in the face-to-face model
- Revolutionaries and Spies on Random Graphs
- The localization game on oriented graphs
- Meyniel extremal families of abelian Cayley graphs
- Pebble guided near optimal treasure hunt in anonymous graphs
- The localization capture time of a graph
- A survey of graph burning
- An invitation to pursuit-evasion games and graph theory
- A tight lower bound for the capture time of the cops and robbers game
- Deterministic treasure hunt in the plane with angular hints
- Comparing the power of cops to zombies in pursuit-evasion games
- Spy-game on graphs: complexity and simple topologies
- Cops and Robbers on Graphs of Bounded Diameter
- Graph searching games and probabilistic methods
- Fundamental groupoids for graphs
- Vertex-edge domination in graphs
- Fine-grained Lower Bounds on Cops and Robbers
- On the conjecture of the smallest 3-cop-win planar graph
- On the subtle nature of a simple logic of the hide and seek game
- Computing the one-visibility cop-win strategies for trees
- A note on deterministic zombies
- Computing the one-visibility copnumber of trees
- Capture-time extremal cop-win graphs
- Limited visibility cops and robber
- How to hunt an invisible rabbit on a graph
- Directed elimination games
- The robot crawler graph process
- Catching an infinitely fast robber on a grid
- Constructible graphs and pursuit
- A homotopy category for graphs
- The one-cop-moves game on planar graphs
- The fast search number of a complete \(k\)-partite graph
- Title not available (Why is that?)
- Generalized cops and robbers: a multi-player pursuit game on graphs
- Title not available (Why is that?)
- Reaching a target in the plane with no information
- Cops and robber on some families of oriented graphs
- Some game-theoretic remarks on two-player generalized cops and robbers games
- A pursuit-evasion differential game with slow pursuers on the edge graph of a simplex. I
- Open problems on search games
- Evacuating two robots from multiple unknown exits in a circle
- A simple logic of the hide and seek game
- Conjectures on cops and robbers
- The node cop‐win reliability of unicyclic and bicyclic graphs
- A survey on the relationship between the game of cops and robbers and other game representations
- Lions and contamination, triangular grids, and Cheeger constants
- One-visibility cops and robber on trees
- The impact of loops on the game of cops and robbers on graphs
- Probabilistic pursuits on graphs
- A game of cops and robbers on graphs with periodic edge-connectivity
- A note on the localization number of random graphs: diameter two case
- General cops and robbers games with randomness
- Burning number of theta graphs
- The optimal capture time of the one-cop-moves game
- On the cop number of generalized Petersen graphs
- To catch a falling robber
- Cop vs. gambler
- Cops and Robbers on Planar‐Directed Graphs
- CADbots: algorithmic aspects of manipulating programmable matter with finite automata
- Containment game played on random graphs: another zig-zag theorem
- Localization game on geometric and planar graphs
- 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\)
- Cops and robbers on graphs based on designs
- Locating a backtracking robber on a tree
- How to Burn a Graph
- Throttling for the game of cops and robbers on graphs
- Fast searching on complete \(k\)-partite graphs
- A robber locating strategy for trees
- Fast searching on Cartesian products of graphs
- Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems
- Selfish cops and active robber: multi-player pursuit evasion on graphs
- On the cop number of toroidal graphs
- Hyperopic cops and robbers
- Cops and invisible robbers: the cost of drunkenness
- Searching for a non-adversarial, uncooperative agent on a cycle
- Centroidal localization game
- The complexity of zero-visibility cops and robber
- Some remarks on cops and drunk robbers
- Cops and robbers is EXPTIME-complete
- A cops and robber game in multidimensional grids
- A note on \(k\)-cop-win graphs
- A deterministic version of the game of zombies and survivors on graphs
- Bounds on the length of a game of cops and robbers
- Cops and an insightful robber
- Variations of cops and robbers game on grids
- Chasing robbers on random geometric graphs-an alternative approach
- Cops and robber on butterflies and solid grids
- Coarse geometry of the cops and robber game
- Visibility graphs, dismantlability, and the cops and robbers game
- 4-cop-win graphs have at least 19 vertices
- Fast searching on cactus graphs
- Lower bounds for the capture time: linear, quadratic, and beyond
- The capture time of the hypercube
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)
