Graph burning: tight bounds on the burning numbers of path forests and spiders

DOI10.1016/j.amc.2020.125447OpenAlexW3036097035MaRDI QIDQ2657308

Wen Chean Teh, Ta Sheng Tan

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

zbMATH Keywords

spidergraph algorithmburning number conjecturepath forest

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Surviving rate of graphs and firefighter problem ⋮ A survey of graph burning ⋮ Parameterized complexity of graph burning ⋮ Parameterized Complexity of Graph Burning ⋮ APX-hardness and approximation for the \(k\)-burning number problem ⋮ Burning numbers of \(t\)-unicyclic graphs ⋮ Burnability of double spiders and path forests

Cites Work

• On the burning number of generalized Petersen graphs
• Bounds on the burning number
• Burning number of graph products
• An upper bound on the burning number of graphs
• Burning graphs: a probabilistic perspective
• Approximation algorithms for graph burning
• Bounds on the burning numbers of spiders and path-forests
• Burning a graph is hard
• Burning spiders
• How to Burn a Graph

This page was built for publication: Graph burning: tight bounds on the burning numbers of path forests and spiders