Lions and contamination: Monotone clearings

Adams, 2022, 191 Isaacs, 1965 Parsons, 1978, Pursuit-evasion in a graph, 426 Adams, 2015, Evasion paths in mobile sensor networks, Int. J. Robot. Res., 34, 90, 10.1177/0278364914548051 de Silva, 2006, Coordinate-free coverage in sensor networks with controlled boundaries via homology, Int. J. Robot. Res., 25, 1205, 10.1177/0278364906072252 LaValle, 1998, Optimal motion planning for multiple robots having independent goals, IEEE Trans. Robot. Autom., 14, 912, 10.1109/70.736775 Bonato, 2013, 1511 Borie, 2013, Section 9.5: pursuit-evasion problems, 1145 Chung, 2011, Search and pursuit-evasion in mobile robotics - a survey, Auton. Robots, 31, 299, 10.1007/s10514-011-9241-4 Fomin, 2008, An annotated bibliography on guaranteed graph searching, Theor. Comput. Sci., 399, 236, 10.1016/j.tcs.2008.02.040 Dumitrescu, 2007, Offline variants of the “lion and man” problem, 102 Brass, 2007, Escaping off-line searchers and a discrete isoperimetric theorem, vol. 4835, 65 Berger, 2009, How many lions are needed to clear a grid?, Algorithms, 2, 1069, 10.3390/a2031069 LaPaugh, 1993, Recontamination does not help to search a graph, J. ACM, 40, 224, 10.1145/151261.151263