Pages that link to "Item:Q2657308"
From MaRDI portal
The following pages link to Graph burning: tight bounds on the burning numbers of path forests and spiders (Q2657308):
Displaying 15 items.
- Burning numbers of path forests and spiders (Q2021650) (← links)
- Improved bounds for burning fence graphs (Q2053737) (← 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)
- The generalized burning number of graphs (Q2245939) (← links)
- Bounds on the burning numbers of spiders and path-forests (Q2328861) (← links)
- Burning a graph is hard (Q2410223) (← links)
- A survey of graph burning (Q4986283) (← links)
- The Burning Number of Directed Graphs: Bounds and Computational Complexity (Q5119806) (← links)
- APX-hardness and approximation for the \(k\)-burning number problem (Q5918792) (← links)
- Parameterized Complexity of Graph Burning (Q6089668) (← links)
- Graph Burning: Tight Bounds on the Burning Numbers of Path Forests and Spiders (Q6326919) (← links)
