M. Aigner and M. Fromme, A game of cops and robbers, Discrete Applied Mathematics, vol.8, pp.1-12, 1984.

P. Balister, A. Shaw, B. Bollobás, and B. P. Narayanan, Catching a fast robber on the grid, JCTA, vol.152, pp.341-352, 2017.

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, Theor. Comput. Sci, vol.411, issue.43, pp.3834-3844, 2010.

A. Bonato and R. J. Nowakowski, The game of Cops and Robbers on Graphs, 2011.

J. A. Bondy and U. S. Murty, Graph theory, volume 244 of Graduate Texts in Mathematics, 2008.

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, FUN 2016, vol.10, pp.1-10, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01279339

N. Cohen, F. Mc-inerney, N. Nisse, and S. Pérennes, Study of a combinatorial game in graphs through linear programming, 28th International Symposium on Algorithms and Computation, vol.22, pp.1-22, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01462890

N. Cohen, N. A. Martins, F. Mc-inerney, N. Nisse, S. Pérennes et al., Spy-game on graphs: Complexity and simple topologies, vol.725, pp.1-15, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01782246

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), vol.7288, pp.166-176, 2012.
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, Theor. Comput. Sci, vol.411, issue.7-9, pp.1167-1181, 2010.
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), 2013.
URL : https://hal.archives-ouvertes.fr/hal-00845531

F. Giroire, N. Nisse, S. Pérennes, and R. P. Soares, Fractional combinatorial games, INRIA, vol.8371, 2013.
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 J. Discrete Math, vol.25, issue.3, pp.1443-1453, 2011.

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, 2010.

W. B. Kinnersley, Cops and robbers is exptime-complete, JCTB, vol.111, pp.201-220, 2015.

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.72, issue.3, pp.758-777, 2015.
URL : https://hal.archives-ouvertes.fr/hal-00687120

R. Kusters, Memoryless determinacy of parity games. Automata, Logics, and Infinite Games: A Guide to Current Research, vol.2500, pp.95-106, 2002.

I. Lamprou, R. Martin, and S. Schewe, Perpetually dominating large grids, 10th International Conference on Algorithms and Complexity (CIAC 2017), pp.393-404, 2017.

R. J. Nowakowski and P. Winkler, Vertex-to-vertex pursuit in a graph, Discrete Maths, vol.43, pp.235-239, 1983.

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 J. Discrete Math, vol.25, issue.3, pp.1438-1442, 2011.

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.