J. Arquilla and H. Fredricksen, Graphing" an optimal grand strategy, Military Oper. Res, vol.1, issue.3, pp.3-17, 1995.

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

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

A. Braga, C. Souza, and O. Lee, The eternal dominating set problem for proper interval graphs, Inform. Process. Lett, vol.115, pp.582-587, 2015.

N. Cohen, F. Mc-inerney, N. Nisse, and S. Pérennes, Study of a combinatorial game in graphs through linear programming, Algorithmica, vol.82, issue.2, pp.212-244, 2020.
URL : https://hal.archives-ouvertes.fr/hal-01582091

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-01463297

D. Cwcf-+-]-c.-m.-chavy-waddy, S. Coakley, M. Finbow, M. Pazos, and . Van-bommel,

A. Z. Delaney and M. E. Messinger, Closing the gap: Eternal domination on 3 × n grids, Contrib. Discrete Math, vol.12, issue.1, pp.47-61, 2017.

S. Finbow, M. E. Messinger, and M. F. Van-bommel, Eternal domination in 3 × n grids, Australas. J. Combin, vol.61, pp.156-174, 2015.

S. Finbow and M. Van-bommel, The eternal domination number for 3× n grid graphs, Australas. J. Combin, vol.76, issue.1, pp.1-23, 2020.

W. Goddard, S. M. Hedetniemi, and S. T. Hedetniemi, Eternal security in graphs, J. Combin. Math. Combin. Comput, vol.52, 2005.

J. L. Goldwasser, W. F. Klostermeyer, and C. M. Mynhardt, Eternal protection in grid graphs, Util. Math, vol.91, pp.47-64, 2013.

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.

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

W. F. Klostermeyer and C. M. Mynhardt, Protecting a graph with mobile guards, Appl. Anal. Discrete Math, vol.10, pp.1-29, 2016.

I. Lamprou, R. Martin, and S. Schewe, Eternally dominating large grids, Theoret. Comput. Sci, vol.794, pp.27-46, 2019.

F. Mc-inerney, N. Nisse, and S. Pérennes, Eternal domination in grids, Algorithms and complexity, vol.11485, pp.311-322, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02098169

C. S. Revelle, Can you protect the roman empire?, Johns Hopkins Mag, vol.50, issue.2, 1997.

C. S. Revelle and K. E. Rosing, Defendens imperium romanum: A classical problem in military strategy, Amer. Math. Monthly, vol.107, pp.585-594, 2000.

I. Stewart, Defend the roman empire! Scientific American, pp.136-138, 1999.

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