Firefighting on square, hexagonal, and triangular grids

DOI10.1016/j.disc.2014.06.020zbMath1301.05241arXiv1305.7076OpenAlexW2089397652MaRDI QIDQ465289

Tomáš Gavenčiak, Paweł Prałat, Jan Kratochvíl

Publication date: 31 October 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.7076

zbMATH Keywords

surviving ratehexagonal gridfirefightersquare grid

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Infinite graphs (05C63)

Related Items (8)

Surviving rate of graphs and firefighter problem ⋮ The firefighter problem: empirical results on random graphs ⋮ Finding exact solutions for the geometric firefighter problem in practice ⋮ Firefighting on the hexagonal grid ⋮ The coarse geometry of Hartnell's firefighter problem on infinite graphs ⋮ Solving the geometric firefighter routing problem via integer programming ⋮ Firefighting as a Strategic Game ⋮ Asymptotic surviving rate of trees with multiple fire sources

Cites Work

• The surviving rate of an infected network
• Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly
• 3/2 firefighters are not enough
• The firefighter problem for graphs of maximum degree three
• Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem
• The Surviving Rate of a Graph for the Firefighter Problem
• Sparse Graphs Are Not Flammable
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Firefighting on square, hexagonal, and triangular grids