The 2-surviving rate of planar graphs without 6-cycles

The firefighter problem models the spread of a fire or virus through a network and the k-surviving rate of G, ρk(G), is the expected proportion of nodes k fire fighters per turn can save. In this paper, we show that if G is a planar graph with at least two vertices and having no 6-cycles, then .