The burning number conjecture is true for trees without degree-2 vertices
From MaRDI portal
Publication:6581897
Recommendations
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
(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)