The capture time of a planar graph

DOI10.1007/S10878-017-0173-6MaRDI QIDQ1631664zbMATH OpenOpenAlexFDO

Authors Photchchara Pisantechakool, Xuehou 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 on graphs (graph-theoretic aspects) (05C57) Positional games (pursuit and evasion, etc.) (91A24) Games involving graphs (91A43)

Recommendations

• On the Capture Time of Cops and Robbers Game on a Planar Graph
• The capture time of a graph
• Cop-win graphs with maximum capture-time
• A game of cops and robbers
• scientific article; zbMATH DE number 5989957

Cites work

• A game of cops and robbers
• A graph search algorithm for indoor pursuit/evasion
• scientific article; zbMATH DE number 3650583 (Why is no real title available?)
• scientific article; zbMATH DE number 3590298 (Why is no real title available?)
• Monotonicity in graph searching
• On the Capture Time of Cops and Robbers Game on a Planar Graph
• Recontamination does not help to search a graph
• Search games
• Searching and sweeping graphs: a brief survey
• The capture time of a graph
• The capture time of grids
• Vertex-to-vertex pursuit in a graph

Cited in

(2)

• Capture-time extremal cop-win graphs
• scientific article; zbMATH DE number 5989957 (Why is no real title available?)

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

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