Variations on cops and robbers
From MaRDI portal
Publication:2891049
DOI10.1002/jgt.20591zbMath1243.05165arXiv1004.2482OpenAlexW1833292044WikidataQ57401447 ScholiaQ57401447MaRDI QIDQ2891049
Po-Shen Loh, Michael Krivelevich, Alan M. Frieze
Publication date: 13 June 2012
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1004.2482
Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (29)
To catch a falling robber ⋮ Cops and Robbers on Geometric Graphs ⋮ Capture times in the bridge-burning cops and robbers game ⋮ On Meyniel's conjecture of the cop number ⋮ Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond ⋮ The game of cops and robbers on directed graphs with forbidden subgraphs ⋮ A probabilistic version of the game of zombies and survivors on graphs ⋮ Catching an infinitely fast robber on a grid ⋮ Catching a fast robber on the grid ⋮ Cops and robbers from a distance ⋮ Chasing a Fast Robber on Planar Graphs and Random Graphs ⋮ Cops and Robber game with a fast robber on expander graphs and random graphs ⋮ Cops and robber on oriented graphs with respect to push operation ⋮ Cops and robber on butterflies, grids, and AT-free graphs ⋮ Lazy Cops and Robbers on Hypercubes ⋮ The one-cop-moves game on graphs with some special structures ⋮ The fast robber on interval and chordal graphs ⋮ Cops and robber on some families of oriented graphs ⋮ Bounds on the length of a game of cops and robbers ⋮ Meyniel's conjecture holds for random graphs ⋮ 4-cop-win graphs have at least 19 vertices ⋮ Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems ⋮ Chasing robbers on random geometric graphs-an alternative approach ⋮ Cops and robbers on directed and undirected abelian Cayley graphs ⋮ Cops, a fast robber and defensive domination on interval graphs ⋮ Conjectures on Cops and Robbers ⋮ Containment game played on random graphs: another zig-zag theorem ⋮ The optimal capture time of the one-cop-moves game ⋮ Meyniel extremal families of abelian Cayley graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cops and robbers from a distance
- The complexity of pursuit on a graph
- A game of cops and robbers
- Note on a pursuit game played on graphs
- An annotated bibliography on guaranteed graph searching
- A witness version of the cops and robber game
- A short note about pursuit games played on a graph with a given genus
- On a pursuit game on Cayley graphs
- Cops and robbers in graphs with large girth and Cayley graphs
- On a pursuit game on Cayley digraphs
- On a pursuit game played on graphs for which a minor is excluded
- Graph searching and a min-max theorem for tree-width
- On the cop number of a graph
- On a game of policemen and robber
- Vertex-to-vertex pursuit in a graph
- Cops and robbers in a random graph
- Pursuing a fast robber on a graph
- A note on \(k\)-cop, \(l\)-robber games on graphs
- On Meyniel's conjecture of the cop number
- Chasing robbers on random graphs: Zigzag theorem
- A better bound for the cop number of general graphs
- Randomized Pursuit-Evasion with Local Visibility
This page was built for publication: Variations on cops and robbers
