Recommendations
Cites work
- Bounds on the burning number
- Burning a graph as a model of social contagion
- Burning a graph is hard
- Burning graphs: a probabilistic perspective
- How to Burn a Graph
- scientific article; zbMATH DE number 1550912 (Why is no real title available?)
- scientific article; zbMATH DE number 6319745 (Why is no real title available?)
Cited in
(29)- Bounds on the burning number
- Burning graphs: a probabilistic perspective
- Burning numbers of path forests and spiders
- Improved bounds for burning fence graphs
- On the burning number of \(p\)-caterpillars
- Burning numbers of \(t\)-unicyclic graphs
- Burnability of double spiders and path forests
- Surviving rate of graphs and firefighter problem
- Burning graph classes
- Parameterized complexity of graph burning
- Burning the plane. Densities of the infinite Cartesian grid
- The generalized burning number of graphs
- Burning number of theta graphs
- Graph burning: tight bounds on the burning numbers of path forests and spiders
- Burning two worlds
- APX-hardness and approximation for the \(k\)-burning number problem
- APX-hardness and approximation for the \(k\)-burning number problem
- Parameterized Complexity of Graph Burning
- Burning Numbers of Barbells
- Burning Hamming graphs
- Burning number of Jahangir graphs
- Burning disjoint union of spider and path
- Algorithms for burning schedule reconfiguration problem on path forests
- Burn and win
- Burning random trees
- A row generation algorithm for finding optimal burning sequences of large graphs
- Between burning and cooling: liminal burning on graphs
- On the burning number of the generalized Heawood graphs
- Burning number of caterpillars
This page was built for publication: Burning number of graph products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1784749)
