13 citations · 25 across the 15 of their papers we have counts for
19 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…
A complete solution to the directed Oberwolfach problem of order with cycles of even lengths
A. C. Burgess, P. H. Danziger, A. Lacaze-Masmonteil
The Oberwolfach problem asks for a -factorization of the complete graph in which each -factor is isomorphic to a specific factor . Recently, this problem has been extended…
Colourings of Uniform Group Divisible Designs and Maximum Packings
Andrea C Burgess, Peter Danziger, Diane Donovan +4
A weak -colouring of a design is an assignment of colours to its points from a set of available colours, such that there are no monochromatic blocks. A colouring of a design…
Packing Designs with large block size
Andrea C. Burgess, Peter Danziger, Daniel Horsley +1
Given positive integers , , and with , a packing design PD is a pair , where is a -set and is a coll…
Weak colourings of Kirkman triple systems
Andrea C. Burgess, Nicholas J. Cavenagh, Peter Danziger +1
A -colouring of the point set of a block design is said to be {\em weak} if no block is monochromatic. The {\em chromatic number} of a block design is the smallest in…
Tic-Tac-Toe on Designs
Peter Danziger, Melissa A. Huggan, Rehan Malik +1
We consider playing the game of Tic-Tac-Toe on block designs BIBD() and transversal designs TD(). Players take turns choosing points and the first player to complete…