5 papers
Mutually orthogonal cycle systems
Andrea C. Burgess, Nicholas J. Cavenagh, David A. Pike
An -cycle system of a graph is a set of -cycles which partition the edge set of . Two such cycle systems and ar…
Colourings of star systems
Iren Darijani, David Pike
An -star is a complete bipartite graph . An -star system of order , , is a partition of the edges of the complete graph into -stars. An -sta…
The Firebreak Problem
Kathleen D. Barnetson, Andrea C. Burgess, Jessica Enright +3
Suppose we have a network that is represented by a graph . Potentially a fire (or other type of contagion) might erupt at some vertex of . We are able to respond to this outb…
A Perfect One-Factorisation of
David A. Pike
In 1963, Anton Kotzig conjectured that for each the complete graph has a perfect one-factorisation (i.e., a decomposition into perfect matchings such that each…
Decomposable twofold triple systems with non-Hamiltonian 2-block intersection graphs
Rosalind A. Cameron, David A. Pike
The 2-block intersection graph (2-BIG) of a twofold triple system (TTS) is the graph whose vertex set is composed of the blocks of the TTS and two vertices are joined by an edge if…