8 citations · 10 across the 10 of their papers we have counts for
1 paper · 1 filter
John Peca-Medlin
The burning number b(G) of a graph G is the minimum number of rounds required to burn all vertices when, at each discrete step, existing fires spread to neighboring vertices an…