A survey of graph burning
From MaRDI portal
Publication:4986283
DOI10.11575/cdm.v16i1.71194zbMath1457.05068arXiv2009.10642OpenAlexW3157462986MaRDI QIDQ4986283
Publication date: 27 April 2021
Full work available at URL: https://arxiv.org/abs/2009.10642
Graph algorithms (graph-theoretic aspects) (05C85) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (11)
Burning graph classes ⋮ Parameterized complexity of graph burning ⋮ Selection of activators in finding the burning number ⋮ Improved and generalized algorithms for burning a planar point set ⋮ Groups burning: analyzing spreading processes in community-based networks ⋮ Burn and win ⋮ Improved pyrotechnics: closer to the burning number conjecture ⋮ APX-hardness and approximation for the \(k\)-burning number problem ⋮ Improved bounds for burning fence graphs ⋮ Burning numbers of \(t\)-unicyclic graphs ⋮ Burnability of double spiders and path forests
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Throttling for the game of cops and robbers on graphs
- Burning number of caterpillars
- An upper bound on the burning number of graphs
- Burning graphs: a probabilistic perspective
- Improved bounds for burning fence graphs
- Burning the plane. Densities of the infinite Cartesian grid
- Burning number of theta graphs
- Parameterized algorithms for Graph Burning problem
- Approximation algorithms for graph burning
- Bounds on the burning numbers of spiders and path-forests
- Tree-decompositions with bags of small diameter
- Burning a graph is hard
- Burning spiders
- Graph burning: tight bounds on the burning numbers of path forests and spiders
- Burning a Graph as a Model of Social Contagion
- The Design of Approximation Algorithms
- Burning Two Worlds
- The Burning Number of Directed Graphs: Bounds and Computational Complexity
- How to Burn a Graph
- Parameterized Complexity of Graph Burning
This page was built for publication: A survey of graph burning
