scientific article; zbMATH DE number 1506515

zbMath0961.05060MaRDI QIDQ4504908

Stephen Finbow, Qiyan Li, Kyle Schmeisser, Bert L. Hartnell

Publication date: 28 May 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

cyclepathtreesconnected graphfirefirefighting

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Related Items

Parameterized Complexity of Firefighting Revisited ⋮ The firefighter problem for graphs of maximum degree three ⋮ Surviving rate of graphs and firefighter problem ⋮ The firefighter problem: empirical results on random graphs ⋮ Firefighting on square, hexagonal, and triangular grids ⋮ Parameterized complexity of firefighting ⋮ The coarse geometry of Hartnell's firefighter problem on infinite graphs ⋮ A generalization of the firefighter problem on \(\mathbb Z \times \mathbb Z\) ⋮ The firefighter problem for cubic graphs ⋮ The surviving rate of an infected network ⋮ The 2-surviving rate of planar graphs without 4-cycles ⋮ Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly ⋮ On structural parameterizations of firefighting ⋮ Firefighting as a Strategic Game