A fire breaks out on a graph and then firefighters protect vertices. At each subsequent interval, the fire spreads to all adjacent unprotected vertices, and firefighters protect unburned vertices. Let be the minimum number of firefighters needed to contain a fire on graph . If the triangular grid goes unprotected to time when firefighters arrive and begin protecting vertices, the fire can be contained by time with at most vertices burned.
