The following pages link to How to Burn a Graph (Q5856432):
Displaying 30 items.
- On the burning number of generalized Petersen graphs (Q723638) (← links)
- Burning number of caterpillars (Q777401) (← links)
- The iterated local model for social networks (Q777439) (← links)
- Burning grids and intervals (Q831694) (← links)
- Bounds on the burning number (Q1682876) (← links)
- Burning number of graph products (Q1784749) (← links)
- Burning graphs: a probabilistic perspective (Q2014226) (← links)
- Burning numbers of path forests and spiders (Q2021650) (← links)
- Improved bounds for burning fence graphs (Q2053737) (← links)
- On the burning number of \(p\)-caterpillars (Q2056898) (← links)
- Burning numbers of \(t\)-unicyclic graphs (Q2064928) (← links)
- Burnability of double spiders and path forests (Q2096325) (← links)
- Surviving rate of graphs and firefighter problem (Q2141321) (← links)
- Burning graph classes (Q2157835) (← links)
- Parameterized complexity of graph burning (Q2161013) (← links)
- A new model and algorithms in firefighting theory (Q2161254) (← links)
- Burning the plane. Densities of the infinite Cartesian grid (Q2227973) (← links)
- The generalized burning number of graphs (Q2245939) (← links)
- Burning number of theta graphs (Q2279597) (← links)
- Bounds on the burning numbers of spiders and path-forests (Q2328861) (← links)
- Burning a graph is hard (Q2410223) (← links)
- Graph burning: tight bounds on the burning numbers of path forests and spiders (Q2657308) (← links)
- Burning Two Worlds (Q3297761) (← links)
- A survey of graph burning (Q4986283) (← links)
- (Q5206905) (← links)
- APX-hardness and approximation for the \(k\)-burning number problem (Q5918792) (← links)
- APX-hardness and approximation for the \(k\)-burning number problem (Q5919106) (← links)
- Parameterized Complexity of Graph Burning (Q6089668) (← links)
- Burning and \(w\)-burning of geometric graphs (Q6103478) (← links)
- Burning Numbers of Barbells (Q6489821) (← links)
