The burning number conjecture is true for trees without degree-2 vertices

DOI10.1007/S00373-024-02812-6MaRDI QIDQ6581897zbMATH OpenFDO

Authors Yukihiro Murakami

Publication date 1 August 2024

Published in Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00373-024-02812-6

zbMATH Keywords

graph burninghomeomorphically irreducible trees

Mathematics Subject Classification ID

Trees (05C05) Games on graphs (graph-theoretic aspects) (05C57) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Games involving graphs (91A43)

Recommendations

• The burning number conjecture holds asymptotically
• Burning graph classes
• Bounds on the burning number
• An upper bound on the burning number of graphs
• Burning spiders

Cites work

• A survey of graph burning
• Bounds on the burning numbers of spiders and path-forests
• Burning a graph as a model of social contagion
• Burning a graph is hard
• Forbidden subgraphs and the existence of a spanning tree without small degree stems
• Graphs with homeomorphically irreducible spanning trees
• Homeomorphically irreducible spanning trees in hexangulations of surfaces
• Homeomorphically irreducible spanning trees in locally connected graphs
• How to Burn a Graph
• On the burning number of \(p\)-caterpillars
• Spanning trees with few non-leaves
• Spanning trees with many leaves
• The burning number conjecture holds asymptotically
• The burning number of directed graphs: bounds and computational complexity
• The number of homeomorphically irreducible trees, and other species
• Transmitting in the n-dimensional cube

Cited in

(4)

• Improved pyrotechnics: closer to the burning number conjecture
• Very short note on burning trees with sufficiently long arms
• The burning number conjecture holds asymptotically
• Burning disjoint union of spider and path

This page was built for publication: The burning number conjecture is true for trees without degree-2 vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6581897)