Library Header Image
LSE Research Online LSE Library Services

Fire containment in planar graphs

Esperet, Louis, van den Heuvel, Jan ORCID: 0000-0003-0897-9148, Maffray, Frederic and Sipma, Felix (2013) Fire containment in planar graphs. Journal of Graph Theory, 73 (3). pp. 267-279. ISSN 0364-9024

Full text not available from this repository.
Identification Number: 10.1002/jgt.21673


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 neighbors. The k-surviving rate of G is the expectation of the proportion of vertices that can be saved from the fire, if the starting vertex of the fire is chosen uniformly at random. For a given class of graphs , we are interested in the minimum value k such that for some constant and all , (i.e., such that linearly many vertices are expected to be saved in every graph from ). In this note, we prove that for planar graphs this minimum value is at most 4, and that it is precisely 2 for triangle-free planar graphs.

Item Type: Article
Official URL:
Additional Information: © 2013 Wiley Periodicals, Inc.
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 17 Apr 2013 10:34
Last Modified: 20 Oct 2021 02:03
Funders: ANR Project HEREDIA, Centre national de la recherche scientifique

Actions (login required)

View Item View Item