Improved pyrotechnics: closer to the burning number conjecture

DOI10.37236/11113arXiv2110.10530OpenAlexW4387402806MaRDI QIDQ6197306

Théo Pierron, Marthe Bonamy, Paul Bastide, Anthony Bonato, Pierre Charbit, Shahin Kamali, Mikaël Rabie

Publication date: 16 February 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

burning number conjectureburning number of a connected graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Cites Work

• Burning number of caterpillars
• Spanning trees in graphs of minimum degree 4 or 5
• Bounds on the burning number
• An upper bound on the burning number of graphs
• On the burning number of \(p\)-caterpillars
• Bounds on the burning numbers of spiders and path-forests
• Burning a Graph as a Model of Social Contagion
• Burning Two Worlds
• Spanning Trees with Many Leaves
• A survey of graph burning
• How to Burn a Graph

This page was built for publication: Improved pyrotechnics: closer to the burning number conjecture