Graph burning: tight bounds on the burning numbers of path forests and spiders (Q2657308)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 7321672
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph burning: tight bounds on the burning numbers of path forests and spiders |
scientific article; zbMATH DE number 7321672 |
Statements
Graph burning: tight bounds on the burning numbers of path forests and spiders (English)
0 references
12 March 2021
0 references
burning number conjecture
0 references
graph algorithm
0 references
spider
0 references
path forest
0 references
0.9342671036720276
0 references
0.9071028828620912
0 references
0.8941022753715515
0 references
0.8712090253829956
0 references
