On the Capture Time of Cops and Robbers Game on a Planar Graph

DOI10.1007/978-3-319-48749-6_1zbMath1436.05075OpenAlexW2543771307MaRDI QIDQ2958299

Photchchara Pisantechakool, Xue-Hou Tan

Publication date: 1 February 2017

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-48749-6_1

zbMATH Keywords

pursuit-evasion gamecops and robber gamecapture timegame length

Mathematics Subject Classification ID

Games involving graphs (91A43) Planar graphs; geometric and topological aspects of graph theory (05C10) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (6)

The capture time of a planar graph ⋮ Capture times in the bridge-burning cops and robbers game ⋮ On the Conjecture of the Smallest 3-Cop-Win Planar Graph ⋮ Throttling for the game of cops and robbers on graphs ⋮ Bounds on the length of a game of cops and robbers ⋮ Chasing a drunk robber in many classes of graphs

Cites Work

• Unnamed Item
• The capture time of grids
• A game of cops and robbers
• A graph search algorithm for indoor pursuit/evasion
• The capture time of a graph
• Search games
• Some results about pursuit games on metric spaces obtained through graph theory techniques
• Vertex-to-vertex pursuit in a graph
• Monotonicity in graph searching
• Recontamination does not help to search a graph

This page was built for publication: On the Capture Time of Cops and Robbers Game on a Planar Graph