M. Aigner and M. Fromme, A game of cops and robbers, Discrete Applied Mathematics, vol.8, issue.1, p.112, 1984.
DOI : 10.1016/0166-218X(84)90073-8

T. Andreae, On a pursuit game played on graphs for which a minor is excluded, Journal of Combinatorial Theory, Series B, vol.41, issue.1, p.3747, 1986.
DOI : 10.1016/0095-8956(86)90026-2

E. R. Berlekamp, J. H. Conway, and R. K. Guy, Winning ways for your mathematical plays, Games in Particular, vol.2, 1982.

A. Bonato and R. Nowakovski, The game of Cops and Robber on Graphs, 2011.
DOI : 10.1090/stml/061

A. P. Burger, E. J. Cockayne, W. R. Ggündlingh, C. M. Mynhardt, J. H. Van-vuuren et al., Innite order domination in graphs, Journal of Combinatorial Mathematics and Combinatorial Computing, vol.50, p.179194, 2004.

F. V. Fomin, F. Giroire, A. Jean-marie, D. Mazauric, and N. Nisse, To satisfy impatient web surfers is hard, 6th Int. Conf. on Fun with Algorithms (FUN), p.166176, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00704201

F. V. Fomin, P. A. Golovach, J. Kratochvíl, N. Nisse, and K. Suchan, Pursuing a fast robber on a graph, Theoretical Computer Science, vol.411, issue.7-9, pp.7-911671181, 2010.
DOI : 10.1016/j.tcs.2009.12.010
URL : https://hal.archives-ouvertes.fr/inria-00476686

F. Giroire, D. Mazauric, N. Nisse, S. Pérennes, and R. P. Soares, Connected Surveillance Game, 20th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Lecture Notes in Computer Science, 2013.
DOI : 10.1145/235160.235164
URL : https://hal.archives-ouvertes.fr/hal-00820271

W. F. Klostermeyer and C. M. Mynhardt, Graphs with equal eternal vertex cover and eternal domination numbers, Discrete Mathematics, vol.311, issue.14, p.31113711379, 2011.
DOI : 10.1016/j.disc.2011.03.026

A. Kosowski, B. Li, N. Nisse, and K. Suchan, k-chordal graphs: From cops and robber to compact routing via treewidth, 39th Int, p.610622, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00687120

T. Luczak and P. Pralat, Chasing robbers on random graphs: Zigzag theorem. Random Struct, Algorithms, vol.37, issue.4, p.516524, 2010.

M. Mamino, On the computational complexity of a game of cops and robbers. CoRR, abs/1202, 2012.

R. J. Nowakowski and P. Winkler, Vertex-to-vertex pursuit in a graph, Discrete Mathematics, vol.43, issue.2-3, p.235239, 1983.
DOI : 10.1016/0012-365X(83)90160-7

A. Quilliot, Problèmes de jeux, de point xe, de connectivité et de représentation sur des graphes, des ensembles ordonnés et des hypergraphes, Thèse de doctorat d'état, 1983.

A. Schrijver, Theory of Linear and Integer Programming Wiley Series in Discrete Mathematics & Optimization, 1998.

B. S. Schröder, The copnumber of a graph is

V. V. Vazirani, Approximation Algorithms, 2004.
DOI : 10.1007/978-3-662-04565-7