Some results about pursuit games on metric spaces obtained through graph theory techniques

DOI10.1016/S0195-6698(86)80017-8zbMath0615.90108MaRDI QIDQ1821043

Alain Quilliot

Publication date: 1986

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

graphmetric spacediscrete pursuit games

Mathematics Subject Classification ID

Positional games (pursuit and evasion, etc.) (91A24)

Related Items

On a pursuit game played on graphs for which a minor is excluded, TIPSY COP AND DRUNKEN ROBBER: A VARIANT OF THE COP AND ROBBER GAME ON GRAPHS, Cop-Robber Guarding Game with Cycle Robber Region, The guarding game is E-complete, Cop-robber guarding game with cycle robber-region, Games on Graphs: Cop and Robber, Hungry Spiders, and Broadcast Domination, On the Capture Time of Cops and Robbers Game on a Planar Graph, How to guard a graph?, An annotated bibliography on guaranteed graph searching, Cops and robber game without recharging, Pursuing a fast robber on a graph, A game of cops and robbers, Note on a pursuit game played on graphs

Cites Work

• A game of cops and robbers
• Vertex-to-vertex pursuit in a graph
• Stochastic differential games
• An example in pursuit theory
• Unnamed Item
• Unnamed Item