A survey of graph burning

A Bonato - arxiv preprint arxiv:2009.10642, 2020 - arxiv.org
Graph burning is a deterministic, discrete-time process that models how influence or
contagion spreads in a graph. Associated to each graph is its burning number, which is a …

[HTML][HTML] Burning a graph is hard

S Bessy, A Bonato, J Janssen, D Rautenbach… - Discrete Applied …, 2017 - Elsevier
Graph burning is a model for the spread of social contagion. The burning number is a graph
parameter associated with graph burning that measures the speed of the spread of …

The burning number conjecture holds asymptotically

S Norin, J Turcotte - Journal of Combinatorial Theory, Series B, 2024 - Elsevier
The burning number b (G) of a graph G is the smallest number of turns required to burn all
vertices of a graph if at every turn a new fire is started and existing fires spread to all …

[HTML][HTML] Bounds on the burning numbers of spiders and path-forests

A Bonato, T Lidbetter - Theoretical Computer Science, 2019 - Elsevier
Graph burning is one model for the spread of memes and contagion in social networks. The
corresponding graph parameter is the burning number of a graph G, written b (G), which …

[HTML][HTML] Burning number of caterpillars

H Liu, X Hu, X Hu - Discrete Applied Mathematics, 2020 - Elsevier
Graph burning is a deterministic discrete time graph process that can be interpreted as a
model for the spread of influence in social networks. The burning number b (G) of a graph G …

[HTML][HTML] Bounds on the burning number

S Bessy, A Bonato, J Janssen, D Rautenbach… - Discrete Applied …, 2018 - Elsevier
Motivated by a graph theoretic process intended to measure the speed of the spread of
contagion in a graph, Bonato et al.(Burning a Graph as a Model of Social Contagion, Lecture …

Approximation algorithms for graph burning

A Bonato, S Kamali - Theory and Applications of Models of Computation …, 2019 - Springer
Numerous approaches study the vulnerability of networks against social contagion. Graph
burning studies how fast a contagion, modeled as a set of fires, spreads in a graph. The …

An upper bound on the burning number of graphs

MR Land, L Lu - Algorithms and Models for the Web Graph: 13th …, 2016 - Springer
The burning number b (G) of a graph G was introduced by Bonato, Janssen, and Roshanbin
Lecture Notes in Computer Science 8882 (2014) to measure the speed of the spread of …

[HTML][HTML] Burning number of graph products

D Mitsche, P Prałat, E Roshanbin - Theoretical Computer Science, 2018 - Elsevier
Graph burning is a deterministic discrete time graph process that can be interpreted as a
model for the spread of influence in social networks. The burning number of a graph is the …

Improved pyrotechnics: closer to the burning graph conjecture

P Bastide, M Bonamy, A Bonato, P Charbit… - arxiv preprint arxiv …, 2021 - arxiv.org
The Burning Number Conjecture claims that for every connected graph $ G $ of order $ n, $
its burning number satisfies $ b (G)\le\lceil\sqrt {n}\rceil. $ While the conjecture remains …