S. Bessy, A. Bonato, J. Janssen, D. Rautenbach, and E. Roshanbin, Burning a graph is hard, Discrete Applied Mathematics, 232 (2017), pp. 73–87.
 E. Birmele, F. De Montgolfier, L. Planche, and L. Viennot ´ , Decomposing a graph into shortest paths with bounded eccentricity, (2017).
 A. Bonato, K. Gunderson, and A. Shaw, Burning the plane: densities of the infinite cartesian grid, arXiv preprint arXiv:1806.05642, (2018).
 A. Bonato, J. Janssen, and E. Roshanbin, Burning a graph as a model of social contagion, in International Workshop on Algorithms and Models for the Web-Graph, Springer, 2014, pp. 13–22.
 , How to burn a graph, Internet Mathematics, 12 (2016), pp. 85–100.
 A. Bonato and S. Kamali, Approximation algorithms for graph burning, in International Conference on Theory and Applications of Models of Computation, Springer, 2019, pp. 74–92.
 A. Bonato and T. Lidbetter, Bounds on the burning numbers of spiders and path-forests, Theoretical Computer Science, 794 (2019), pp. 12–19.
 R. Diestel, Graduate texts in mathematics, Graph theory, 173 (2000).
 D. Eichhorn, D. Mubayi, K. O’Bryant, and D. B. West, The edge-bandwidth of theta graphs, Journal of Graph Theory, 35 (2000), pp. 89–98.
 A. Hagberg, P. Swart, and D. S Chult, Exploring network structure, dynamics, and function using networkx, tech. rep., Los Alamos National Lab.(LANL), Los Alamos, NM (United States), 2008.
 S. Kamali, A. Miller, and K. Zhang, Burning two worlds: algorithms for burning dense and tree-like graphs, arXiv preprint arXiv:1909.00530, (2019).
 , Burning two worlds, in International Conference on Current Trends in Theory and Practice of Informatics, Springer, 2020, pp. 113–124.
 A. S. Kare and I. V. Reddy, Parameterized algorithms for graph burning problem, in International Workshop on Combinatorial Algorithms, Springer, 2019, pp. 304–314.
 H. Liu, R. Zhang, and X. Hu, Burning number of theta graphs, Applied Mathematics and Computation, 361 (2019), pp. 246–257.
 D. Mitsche, P. Pra lat, and E. Roshanbin, Burning number of graph products, Theoretical Computer Science, 746 (2018), pp. 124–135.
 E. Roshanbin, Burning a graph as a model of social contagion, PhD thesis, Dalhousie University, 2016.
 R. A. Rossi and N. K. Ahmed, The network data repository with interactive graph analytics and visualization, in AAAI, 2015.
 K. A. Sim, T. S. Tan, and K. B. Wong, On the burning number of generalized petersen graphs, Bulletin of the Malaysian Mathematical Sciences Society, 41 (2018), pp. 1657–1670.
 M. Simon, L. Huraj, I. Dirgov ˇ a Lupt ´ akov ´ a, and J. Posp ´ ´ıchal, Heuristics for spreading alarm throughout a network, Applied Sciences, 9 (2019), p. 3269.