Fire Containment in Planar Graphs

Louis Esperet, Jan van den Heuvel, Frédéric Maffray +1

In a graph $G$, a fire starts at some vertex. At every time step, firefighters can protect up to $k$ vertices, and then the fire spreads to all unprotected neighbours. The $k$-surv…