Murakami, Y. (2024) The Burning Number Conjecture Is True for Trees without Degree-2 Vertices. Graphs and Combinatorics, 40, Article No. 82.
https://doi.org/10.1007/s00373-024-02812-6

has been cited by the following article:

• TITLE: Note on the Burning Conjecture for Some Graphs

  AUTHORS: Qiuye Zhu, Yinkui Li

  KEYWORDS: Graph Burning, Burning Number, Octopus Graph, Bicyclic Graph

  JOURNAL NAME: Open Journal of Applied Sciences, Vol.15 No.5, May 9, 2025

  ABSTRACT: Graph burning is a model for describing the spread of influence in social networks and the burning number is a parameter used to describe the speed of information spread. In 2016, Bonato proposed a graph burning conjecture: For any connected graph G with order n , the burning number b( G )≤⌈ n ⌉ . In this paper, we confirm the burning conjecture for octopus graph and bicyclic graph.