The burning number conjecture is true for trees without degree-2 vertices
From MaRDI portal
Publication:6581897
DOI10.1007/S00373-024-02812-6zbMATH Open1544.05106MaRDI QIDQ6581897FDOQ6581897
Authors: Yukihiro Murakami 
Publication date: 1 August 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Recommendations
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Games on graphs (graph-theoretic aspects) (05C57) Structural characterization of families of graphs (05C75) Games involving graphs (91A43)
Cites Work
- Transmitting in the \(n\)-dimensional cube
- Homeomorphically irreducible spanning trees in locally connected graphs
- Forbidden subgraphs and the existence of a spanning tree without small degree stems
- Graphs with homeomorphically irreducible spanning trees
- The number of homeomorphically irreducible trees, and other species
- Spanning trees with many leaves
- Burning a graph is hard
- Burning a graph as a model of social contagion
- How to Burn a Graph
- On the burning number of \(p\)-caterpillars
- Bounds on the burning numbers of spiders and path-forests
- Spanning trees with few non-leaves
- A survey of graph burning
- The burning number of directed graphs: bounds and computational complexity
- Homeomorphically irreducible spanning trees in hexangulations of surfaces
- The burning number conjecture holds asymptotically
Cited In (3)
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)
