The capture time of a planar graph

DOI10.1007/s10878-017-0173-6zbMath1411.91113OpenAlexW2755406360MaRDI QIDQ1631664

Photchchara Pisantechakool, Xue-Hou Tan

Publication date: 6 December 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0173-6

zbMATH Keywords

capture timecops and robbers gameguarded shortest pathrobber territory

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Vertex-to-vertex pursuit in a graph
• On the Capture Time of Cops and Robbers Game on a Planar Graph
• Monotonicity in graph searching
• Recontamination does not help to search a graph

This page was built for publication: The capture time of a planar graph