Graph burning: tight bounds on the burning numbers of path forests and spiders
From MaRDI portal
Publication:2657308
DOI10.1016/J.AMC.2020.125447OpenAlexW3036097035MaRDI QIDQ2657308FDOQ2657308
Authors: Ta Sheng Tan, Wen Chean Teh 
Publication date: 12 March 2021
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.04399
Recommendations
Cites Work
- Bounds on the burning number
- An upper bound on the burning number of graphs
- Burning graphs: a probabilistic perspective
- Burning a graph is hard
- How to Burn a Graph
- On the burning number of generalized Petersen graphs
- Burning number of graph products
- Bounds on the burning numbers of spiders and path-forests
- Burning spiders
- Approximation algorithms for graph burning
Cited In (19)
- Very short note on burning trees with sufficiently long arms
- Bounds on the burning numbers of spiders and path-forests
- Surviving rate of graphs and firefighter problem
- Graph Burning: Tight Bounds on the Burning Numbers of Path Forests and Spiders
- Burning spiders
- A survey of graph burning
- Parameterized Complexity of Graph Burning
- Burning graph classes
- Parameterized complexity of graph burning
- An upper bound on the burning number of graphs
- APX-hardness and approximation for the \(k\)-burning number problem
- Improved bounds for burning fence graphs
- Burning numbers of \(t\)-unicyclic graphs
- The generalized burning number of graphs
- Burning a graph is hard
- The burning number of directed graphs: bounds and computational complexity
- Upper bounds and approximation results for the \(k\)-slow burning problem
- Burning numbers of path forests and spiders
- Burnability of double spiders and path forests
This page was built for publication: Graph burning: tight bounds on the burning numbers of path forests and spiders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2657308)
