An upper bound on the burning number of graphs
From MaRDI portal
Publication:1989492
DOI10.1007/978-3-319-49787-7_1zbMath1398.68405arXiv1606.07614OpenAlexW2962945827MaRDI QIDQ1989492
Publication date: 26 October 2018
Full work available at URL: https://arxiv.org/abs/1606.07614
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (21)
Surviving rate of graphs and firefighter problem ⋮ A survey of graph burning ⋮ Burning graph classes ⋮ Parameterized complexity of graph burning ⋮ Graph burning: tight bounds on the burning numbers of path forests and spiders ⋮ Burn and win ⋮ Improved pyrotechnics: closer to the burning number conjecture ⋮ Burning the plane. Densities of the infinite Cartesian grid ⋮ Burning Two Worlds ⋮ Parameterized Complexity of Graph Burning ⋮ Burning graphs: a probabilistic perspective ⋮ Burning numbers of path forests and spiders ⋮ Burning number of theta graphs ⋮ On the burning number of generalized Petersen graphs ⋮ APX-hardness and approximation for the \(k\)-burning number problem ⋮ APX-hardness and approximation for the \(k\)-burning number problem ⋮ Improved bounds for burning fence graphs ⋮ Burning numbers of \(t\)-unicyclic graphs ⋮ Burning number of caterpillars ⋮ Bounds on the burning numbers of spiders and path-forests ⋮ Burnability of double spiders and path forests
This page was built for publication: An upper bound on the burning number of graphs
