Bounds on the burning number

DOI10.1016/j.dam.2017.09.012zbMath1375.05192arXiv1511.06023OpenAlexW2963215841MaRDI QIDQ1682876

Stéphane Bessy, Elham Roshanbin, Dieter Rautenbach, Anthony Bonato, Jeannette C. M. Janssen

Publication date: 6 December 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

distance dominationburning

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (21)

Burning grids and intervals ⋮ Surviving rate of graphs and firefighter problem ⋮ Parameterized complexity of graph burning ⋮ Graph burning: tight bounds on the burning numbers of path forests and spiders ⋮ Burning a graph is hard ⋮ Selection of activators in finding the burning number ⋮ Burning and \(w\)-burning of geometric graphs ⋮ Improved pyrotechnics: closer to the burning number conjecture ⋮ Burning the plane. Densities of the infinite Cartesian grid ⋮ Parameterized Complexity of Graph Burning ⋮ Burning graphs: a probabilistic perspective ⋮ Burning numbers of path forests and spiders ⋮ Burning number of graph products ⋮ Burning number of theta graphs ⋮ Throttling for the game of cops and robbers on graphs ⋮ APX-hardness and approximation for the \(k\)-burning number problem ⋮ Improved bounds for burning fence graphs ⋮ Burning numbers of \(t\)-unicyclic graphs ⋮ Burning number of caterpillars ⋮ Bounds on the burning numbers of spiders and path-forests ⋮ Burnability of double spiders and path forests

Cites Work

• Relations between packing and covering numbers of a tree
• Extremal values of the chromatic number for a given degree sequence
• Burning a graph is hard
• Burning a Graph as a Model of Social Contagion
• How to Burn a Graph
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounds on the burning number