On a Characterization of Evasion Strategies for Pursuit-Evasion Games on Graphs

We give a characterization of robber-win strategies for general pursuit-evasion games with one evader and any finite number of pursuers on a finite graph. We also give an algorithm that solves robber-win games.

[1]  A. Bonato,et al.  Meyniel’s conjecture on the cop number: A survey , 2013, 1308.3385.

[2]  Peter Winkler,et al.  Vertex-to-vertex pursuit in a graph , 1983, Discret. Math..

[3]  Anthony Bonato,et al.  Pursuit-Evasion in Models of Complex Networks , 2007, Internet Math..

[4]  Martin Aigner,et al.  A game of cops and robbers , 1984, Discret. Appl. Math..

[5]  Peter Frankl,et al.  Cops and robbers in graphs with large girth and Cayley graphs , 1987, Discret. Appl. Math..

[6]  T. D. Parsons,et al.  Pursuit-evasion in a graph , 1978 .