Andrea C. Burgess

On the Hamilton–Waterloo Problem with cycle lengths of distinct parities

Let

Zero-sum flows for triple systems

K_v^*

On the Hamilton–Waterloo Problem with Odd Orders

denote the complete graph

Cops and Robbers on Graphs Based on Designs

K_v

Orthogonally Resolvable Cycle Decompositions

if

Generalized covering designs and clique coverings

v

Generalized packing designs

is odd and

On the Hamilton–Waterloo problem with odd cycle lengths

K_v-I

Closed trail decompositions of complete equipartite graphs

, the complete graph with the edges of a 1-factor removed, if

Coloring 4‐cycle systems

v