Burning grids and intervals
From MaRDI portal
Cites work
- Approximation algorithms for graph burning
- Automata, Languages and Programming
- Bounds on the burning number
- Bounds on the burning numbers of spiders and path-forests
- Burning a graph as a model of social contagion
- Burning a graph is hard
- Burning spiders
- Burning two worlds
- Cleaning regular graphs with brushes
- Epidemic Spreading With External Agents
- Graph bootstrap percolation
- How to Burn a Graph
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Parameterized algorithms for Graph Burning problem
- The Firefighter problem: a survey of results, directions and questions
Cited in
(9)- Bounds on the burning number
- On the structure and accuracy of programmed burn
- Burning and \(w\)-burning of geometric graphs
- NP-Completeness Results for Graph Burning on Geometric Graphs
- Burning number of Jahangir graphs
- Burning sufficiently large p-caterpillars for a fixed p
- Burning disjoint union of spider and path
- A row generation algorithm for finding optimal burning sequences of large graphs
- On the burning number of the generalized Heawood graphs
This page was built for publication: Burning grids and intervals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831694)
