M. [. Aigner, . R. Fromme-[-bcg82-]-e, J. H. Berlekamp, R. K. Conway, and . Guy, A game of cops and robbers, Winning Ways, for Your Mathematical Plays: Games in particular. Winning Ways, pp.1-12, 1982.
DOI : 10.1016/0166-218X(84)90073-8

A. P. Burger, E. J. Cockayne, W. R. Grundlingh, C. M. Mynhardt, J. H. Van-vuuren et al., Infinite order domination in graphs, The Game of Cops and Robbers on Graphs. Student Mathematical Library, pp.179-194, 2004.

. V. Fgjm-+-12-]-f, F. Fomin, A. Giroire, D. Jean-marie, N. Mazauric et al., To satisfy impatient web surfers is hard, Fun with Algorithms Best paper in AlgoTel'12, pp.166-176

F. Giroire, N. Nisse, S. Perennes, and R. P. Soares, Fractional combinatorial games, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00865345

A. Kosowski, B. Li, N. Nisse, K. Suchankm11, ]. W. Klostermeyer et al., k-chordal graphs: From cops and robber to compact routing via treewidth Also published in AlgoTel'12 Graphs with equal eternal vertex cover and eternal domination numbers On the computational complexity of a game of cops and robbers Approximation Algorithms, ICALP, pp.610-622, 2004.