Bounds on the burning numbers of spiders and path-forests

DOI10.1016/j.tcs.2018.05.035zbMath1433.05297arXiv1707.09968OpenAlexW2963174930MaRDI QIDQ2328861

Thomas F. Lidbetter, Anthony Bonato

Publication date: 16 October 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.09968

zbMATH Keywords

approximation algorithmgraphstreesspidersburning numberpath-forest

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (20)

Burning grids and intervals ⋮ Surviving rate of graphs and firefighter problem ⋮ A survey of graph burning ⋮ Burning graph classes ⋮ Parameterized complexity of graph burning ⋮ Graph burning: tight bounds on the burning numbers of path forests and spiders ⋮ Burning and \(w\)-burning of geometric graphs ⋮ On minimum intersections of certain secondary dominating sets in graphs ⋮ Improved pyrotechnics: closer to the burning number conjecture ⋮ Burning the plane. Densities of the infinite Cartesian grid ⋮ Burning Two Worlds ⋮ Parameterized Complexity of Graph Burning ⋮ Burning numbers of path forests and spiders ⋮ Burning number of theta graphs ⋮ APX-hardness and approximation for the \(k\)-burning number problem ⋮ APX-hardness and approximation for the \(k\)-burning number problem ⋮ On the burning number of \(p\)-caterpillars ⋮ Burning numbers of \(t\)-unicyclic graphs ⋮ Burning number of caterpillars ⋮ Burnability of double spiders and path forests

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

This page was built for publication: Bounds on the burning numbers of spiders and path-forests