The capture time of grids

DOI10.1016/j.disc.2010.10.002zbMath1203.91039arXiv1008.4424OpenAlexW2171304259MaRDI QIDQ616367

Abbas Mehrabian

Publication date: 7 January 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

gridsCartesian productscops and robber gamecapture time

Mathematics Subject Classification ID

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

Related Items (20)

Cops and robber on butterflies and solid grids ⋮ Cops and Robbers on Geometric Graphs ⋮ The capture time of a planar graph ⋮ Capture times in the bridge-burning cops and robbers game ⋮ Lower Bounds for the Capture Time: Linear, Quadratic, and Beyond ⋮ The game of overprescribed Cops and Robbers played on graphs ⋮ Some remarks on cops and drunk robbers ⋮ On the Capture Time of Cops and Robbers Game on a Planar Graph ⋮ Cops and robber on butterflies, grids, and AT-free graphs ⋮ A tight lower bound for the capture time of the cops and robbers game ⋮ Cops and robber game on infinite chessboard ⋮ The capture time of the hypercube ⋮ Unnamed Item ⋮ Throttling for the game of cops and robbers on graphs ⋮ Bounds on the length of a game of cops and robbers ⋮ The game of cops and eternal robbers ⋮ Linguistic geometry approach for solving the cops and robber problem in grid environments ⋮ Conjectures on Cops and Robbers ⋮ Chasing a drunk robber in many classes of graphs ⋮ The optimal capture time of the one-cop-moves game

Cites Work

• Cop-win graphs with maximum capture-time
• The capture time of a graph
• A game of cops and robbers played on products of graphs
• Vertex-to-vertex pursuit in a graph
• A note on \(k\)-cop, \(l\)-robber games on graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: The capture time of grids