13 citations · 15 across the 4 of their papers we have counts for
4 papers
Burning Steiner triple systems
Andrea C. Burgess, Peter H. Danziger, Caleb W. Jones +2
Graph burning is a round-based process which can be viewed as a discrete one-player game that models the spread of influence throughout a network. Extending this process to hypergr…
Proportion-Based Hypergraph Burning
Andrea C. Burgess, John A. Hawkin, Alexander J. M. Howse +2
Graph burning is a discrete process that models the spread of influence through a network using a fire as a proxy for the type of influence being spread. This process was recently…
Extending Graph Burning to Hypergraphs
Andrea C. Burgess, Caleb W. Jones, David A. Pike
Graph burning is a round-based game or process that discretely models the spread of influence throughout a network. We introduce a generalization of graph burning which applies to…
Cops that surround a robber
Andrea C. Burgess, Rosalind A. Cameron, Nancy E. Clarke +4
We introduce the game of Surrounding Cops and Robbers on a graph, as a variant of the original game of Cops and Robbers. In contrast to the original game in which the cops win by o…