Firefighting on square, hexagonal, and triangular grids
From MaRDI portal
Publication:465289
DOI10.1016/j.disc.2014.06.020zbMath1301.05241arXiv1305.7076MaRDI QIDQ465289
Jan Kratochvíl, Paweł Prałat, Tomáš Gavenčiak
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
68R10: Graph theory (including graph drawing) in computer science
05C38: Paths and cycles
05C85: Graph algorithms (graph-theoretic aspects)
05C63: Infinite graphs
Related Items
The firefighter problem: empirical results on random graphs, The coarse geometry of Hartnell's firefighter problem on infinite graphs, 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