2 citations · 2 across the 7 of their papers we have counts for
3 papers · 2 filters
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…
Locally Semi-Equitable Colourings of BIBDs
Andrea C. Burgess, William Kellough, David A. Pike
We study -colourings of -BIBDs (balanced incomplete block designs) where, within each block, one colour is absent and each of the other colours appears exac…
Uniquely 2-colourable 4-cycle decompositions
Andrea C. Burgess, David A. Pike, Shahriyar Pourakbar-Saffar
A cycle system of order is a decomposition of the edges of the complete graph into cycles of a fixed length. A cycle system is said to be -colourable if we can assign…