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

P. Balister, S. Binski, B. Bollobás, and B. P. Narayanan, Catching a fast robber on the grid, Journal of Combinatorial Theory, Series A, vol.152
DOI : 10.1016/j.jcta.2017.06.009

I. Beaton, S. Finbow, and J. A. Macdonald, Eternal domination numbers of 4 × n grid graphs, J. Comb. Math. Comb. Comput, vol.85, pp.33-48, 2013.

A. Bonato, E. Chiniforooshan, and P. Pralat, Cops and Robbers from a distance, Theoretical Computer Science, vol.411, issue.43, pp.3834-3844, 2010.
DOI : 10.1016/j.tcs.2010.07.003
URL : http://doi.org/10.1016/j.tcs.2010.07.003

A. Bonato and R. J. Nowakowski, The game of Cops and Robbers on Graphs, 2011.
DOI : 10.1090/stml/061

J. A. Bondy and U. S. Murty, Graph theory, Graduate Texts in Mathematics, vol.244, 2008.
DOI : 10.1007/978-1-84628-970-5

A. Burger, E. J. Cockayne, W. R. Gründlingh, C. M. Mynhardt, J. H. Van-vuuren et al., Infinite order domination in graphs, J. Comb. Math. Comb. Comput, vol.50, pp.179-194, 2004.

N. Cohen, M. Hilaire, N. A. Martins, N. Nisse, and S. Pérennes, Spy-game on graphs, 8th International Conference on Fun with Algorithms, pp.1-1016, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01279339

N. Cohen, N. A. Martins, F. Mc-inerney, N. Nisse, S. Pérennes et al., Spy-game on graphs
URL : https://hal.archives-ouvertes.fr/hal-01279339

A. Z. Delaney and M. E. Messinger, Closing the gap: Eternal domination on 3 × n grids, 2015.

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), pp.166-176, 2012.
DOI : 10.1016/j.tcs.2014.01.009
URL : https://hal.archives-ouvertes.fr/hal-00966985

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.411-418, 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.1016/j.tcs.2014.11.025
URL : https://hal.archives-ouvertes.fr/hal-00845531

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

W. Goddard, S. M. Hedetniemi, and S. T. Hedetniemi, Eternal security in graphs, J. Comb. Math. Comb. Comput, vol.52, pp.160-180, 2005.

D. Gonçalves, A. Pinlou, M. Rao, and S. Thomassé, The Domination Number of Grids, SIAM Journal on Discrete Mathematics, vol.25, issue.3, pp.1443-1453, 2011.
DOI : 10.1137/11082574

G. Joret, M. Kaminski, and D. O. Theis, The cops and robber game on graphs with forbidden (induced) subgraphs, Contributions to Discrete Mathematics, vol.5, issue.2, p.2010

W. B. Kinnersley, Cops and Robbers is EXPTIME-complete, Journal of Combinatorial Theory, Series B, vol.111, pp.201-220, 2015.
DOI : 10.1016/j.jctb.2014.11.002
URL : http://arxiv.org/abs/1309.5405

W. F. Klostermeyer and G. Macgillivray, Eternal dominating sets in graphs, J. Comb. Math. Comb. Comput, vol.68, 2009.

A. Kosowski, B. Li, N. Nisse, and K. Suchan, k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth, Algorithmica, vol.393, issue.6684, pp.758-777, 2015.
DOI : 10.1038/30918
URL : https://hal.archives-ouvertes.fr/hal-00671861

I. Lamprou, R. Martin, and S. Schewe, Perpetually Dominating Large Grids
DOI : 10.2307/2589113

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

A. Quilliot, Probì emes de jeux, de point fixe, de connectivité et de représentation sur des graphes, des ensembles ordonnés et des hypergraphes, 1983.

B. S. Schröder, The copnumber of a graph is bounded by 3 2 genus(g) + 3. Categorical perspectives, Trends in Mathematics, pp.243-263, 1998.

A. Scott and B. Sudakov, A Bound for the Cops and Robbers Problem, SIAM Journal on Discrete Mathematics, vol.25, issue.3, pp.1438-1442, 2011.
DOI : 10.1137/100812963

C. M. Van-bommel and M. F. Van-bommel, Eternal domination numbers of 5 × n grid graphs, J. Comb. Math. Comb. Comput, vol.97, pp.83-102, 2016.