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 QIDQ6581897
Publication date: 1 August 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Could not fetch data.
Trees (05C05) Games involving graphs (91A43) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Forbidden subgraphs and the existence of a spanning tree without small degree stems
- The number of homeomorphically irreducible trees, and other species
- Transmitting in the \(n\)-dimensional cube
- On the burning number of \(p\)-caterpillars
- Homeomorphically irreducible spanning trees in hexangulations of surfaces
- Bounds on the burning numbers of spiders and path-forests
- Burning a graph is hard
- Homeomorphically Irreducible Spanning Trees in Locally Connected Graphs
- Burning a Graph as a Model of Social Contagion
- Graphs with homeomorphically irreducible spanning trees
- A survey of graph burning
- The Burning Number of Directed Graphs: Bounds and Computational Complexity
- How to Burn a Graph
- Spanning trees with many leaves
- Spanning trees with few non-leaves
- The burning number conjecture holds asymptotically
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)
