The burning number conjecture holds for trees of order $n$ with at most $\left\lfloor \sqrt{n-1}\right\rfloor$ degree-2 vertices

Documenti analoghi

• Twist polynomial as a weight system for set systems
  di: Deng, Qingying, et al.
  Pubblicazione: (2024)
• On the enumeration of connected sets in finite cylindrical lattice graphs
  di: Ma, Hongxia, et al.
  Pubblicazione: (2025)
• A characterization of always solvable trees in the Lights Out game using the activation types of vertices
  di: Batal, Ahmet
  Pubblicazione: (2020)
• The 2-burning number of a graph
  di: Jacobs, C. B., et al.
  Pubblicazione: (2024)
• Proving the existence of Euclidean knight's tours on $n \times n \times \cdots \times n$ chessboards for $n < 4$
  di: Ripà, Marco
  Pubblicazione: (2023)