Catching a fast robber on the grid

DOI10.1016/j.jcta.2017.06.009zbMath1369.05145arXiv1609.01002OpenAlexW2964046167MaRDI QIDQ2401986

Béla Bollobás, Amy Shaw, Paul N. Balister, Bhargav P. Narayanan

Publication date: 5 September 2017

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.01002

zbMATH Keywords

games on graphscops and robbers

Mathematics Subject Classification ID

Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (8)

Cops and robber on butterflies and solid grids ⋮ Capture times in the bridge-burning cops and robbers game ⋮ Catching an infinitely fast robber on a grid ⋮ Spy game: FPT-algorithm, hardness and graph products ⋮ Cops and robber on butterflies, grids, and AT-free graphs ⋮ Spy game: FPT-algorithm and results on graph products ⋮ Study of a combinatorial game in graphs through linear programming ⋮ Spy-game on graphs: complexity and simple topologies

Cites Work

• On a generalization of Meyniel's conjecture on the Cops and Robbers game
• The angel and the devil in three dimensions
• Conway's Angel in three dimensions
• On a game of policemen and robber
• Vertex-to-vertex pursuit in a graph
• Meyniel's conjecture on the cop number: a survey
• Pursuing a fast robber on a graph
• Variations on cops and robbers
• On Meyniel's conjecture of the cop number
• A Bound for the Cops and Robbers Problem
• The Angel Game in the Plane
• The Angel of Power 2 Wins
• Lower Bounds for the Cop Number when the Robber is Fast
• Fast Robber in Planar Graphs

This page was built for publication: Catching a fast robber on the grid