Firefighting on the Hexagonal Grid and on Infinite Trees

Alexander Dean, Sean English, Tongyun Huang +4

The firefighter problem with $k$ firefighters on an infinite graph $G$ is an iterative graph process, defined as follows: Suppose a fire breaks out at a given vertex $v\in V(G)$ on…