13 citations · 35 across the 16 of their papers we have counts for
5 papers · 1 filter
Existential Closure in Line Graphs
Andrea C. Burgess, Robert D. Luther, David A. Pike
A graph is {\it -existentially closed} if, for all disjoint sets of vertices and with , there is a vertex not in adjacent to each vertex o…
Constructing uniform 2-factorizations via row-sum matrices: solutions to the Hamilton-Waterloo problem
A. C. Burgess, P. Danziger, A. Pastine +1
In this paper, we formally introduce the concept of a row-sum matrix over an arbitrary group . When is cyclic, these types of matrices have been widely used to build uniform…
The Edge-Connectivity of Vertex-Transitive Hypergraphs
Andrea C. Burgess, Robert D. Luther, David A. Pike
A graph or hypergraph is said to be vertex-transitive if its automorphism group acts transitively upon its vertices. A classic theorem of Mader asserts that every connected vertex-…
Firefighting with a Distance-Based Restriction
Andrea Burgess, John Marcoux, David Pike
In the classic version of the game of firefighter, on the first turn a fire breaks out on a vertex in a graph and then firefighters protect vertices. On each subsequent…
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…