1. RP 2019. Lecture Notes in Computer Science;V Blažej,2019
2. Cohen, N., Martins, N.A., Mc Inerney, F., Nisse, N., Pérennes, S., Sampaio, R.: Spy-game on graphs: complexity and simple topologies. Theor. Comput. Sci. 725, 1–15 (2018)
3. Finbow, S., Gaspers, S., Messinger, M.E., Ottoway, P.: A note on the eternal dominating set problem. Int. J. Game Theory 47, 543–555 (2018)
4. Finbow, S., Messinger, M.E., van Bommel, M.F.: Eternal domination on $$3 \times n$$ grids. Australas. J. Comb. 61(2), 156–174 (2015)
5. Gagnon, A., Hassler, A., Huang, J., Krim-Yee, A., Mc Inerney, F., Zacarias, A., Seamone, B., Virgile, V.: A method for eternally dominating strong grids. Discrete Math. Theor. Comput. Sci. 22(1), 1–11 (2020)