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

DOI10.1016/J.AMC.2020.125447MaRDI QIDQ2657308zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

spidergraph algorithmburning number conjecturepath forest

Mathematics Subject Classification ID

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

Recommendations

• Bounds on the burning numbers of spiders and path-forests
• Burning numbers of path forests and spiders
• Burning spiders
• Burnability of double spiders and path forests
• Burning a graph is hard

Cites work

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

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
• 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
• Improved bounds for burning fence graphs
• Burning numbers of \(t\)-unicyclic graphs
• APX-hardness and approximation for the \(k\)-burning number problem
• The generalized burning number of graphs
• Burning a graph is hard
• The burning number of directed graphs: bounds and computational complexity
• Graph Burning: Tight Bounds on the Burning Numbers of Path Forests and Spiders
• 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)