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

DOI10.1007/978-3-319-48749-6_1MaRDI QIDQ2958299zbMATH OpenOpenAlexFDO

Authors Photchchara Pisantechakool, Xuehou 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

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

Recommendations

• A tight lower bound for the capture time of the cops and robbers game
• A tight lower bound for the capture time of the cops and robbers game
• The game of cops and robbers on graphs
• The game of Cops and Robber on circulant graphs
• Cops and Robbers on Planar‐Directed Graphs
• A game of cops and robbers on graphs with periodic edge-connectivity
• Generalized cops and robbers: a multi-player pursuit game on graphs
• Cops and Robber game with a fast robber on expander graphs and random graphs
• Cops and Robbers on Graphs of Bounded Diameter
• A note on the cops and robber game on graphs embedded in non-orientable surfaces

Cites work

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

Cited in

(9)

• Chasing a drunk robber in many classes of graphs
• scientific article; zbMATH DE number 5989957 (Why is no real title available?)
• The capture time of a planar graph
• Throttling for the game of cops and robbers on graphs
• Capture times in the bridge-burning cops and robbers game
• On the conjecture of the smallest 3-cop-win planar graph
• Bounds on the length of a game of cops and robbers
• Generalized cops and robbers: a multi-player pursuit game on graphs
• Cops and Robber game with a fast robber on expander graphs and random graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958299)