1. Braga, A., de Souza, C.C., Lee, O.: The eternal dominating set problem for proper interval graphs. Inf. Process. Lett. 115(6), 582–587 (2015)
2. Burger, A.P., Cockayne, E.J., Gründlingh, W.R., Mynhardt, C.M., van Vuuren, J.H., Winterbach, W.: Infinite order domination in graphs. J. Comb. Math. Comb. Comput. 50, 179–194 (2004)
3. Finbow, S., Messinger, M.-E., van Bommel, M.F.: Eternal domination on 3
$$\times $$
×
n grid graphs. Australas. J. Comb. 61, 156–174 (2015)
4. Goddard, W., Hedetniemi, S.M., Hedetniemi, S.T.: Eternal security in graphs. J. Comb. Math. Comb. Comput. 52, 169–180 (2005)
5. Gupta, U.I., Lee, D.-T., Leung, J.Y.-T.: Efficient algorithms for interval graphs and circular arc graphs. Networks 12(4), 459–467 (1982)