Pages that link to "Item:Q2021650"
From MaRDI portal
The following pages link to Burning numbers of path forests and spiders (Q2021650):
Displaying 12 items.
- Burning number of caterpillars (Q777401) (← links)
- Burning numbers of \(t\)-unicyclic graphs (Q2064928) (← links)
- Burnability of double spiders and path forests (Q2096325) (← links)
- Parameterized complexity of graph burning (Q2161013) (← links)
- Burning a graph is hard (Q2410223) (← links)
- Graph burning: tight bounds on the burning numbers of path forests and spiders (Q2657308) (← 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)
- Burning and \(w\)-burning of geometric graphs (Q6103478) (← links)
- Burning Numbers of Barbells (Q6489821) (← links)
- Burning number of Jahangir graphs (Q6650883) (← links)