The following pages link to Andrea C. Burgess (Q385378):
Displaying 39 items.
- (Q281573) (redirect page) (← links)
- (Q1744747) (redirect page) (← links)
- Decompositions of complete graphs into bipartite 2-regular subgraphs (Q281575) (← links)
- On generalized Howell designs with block size three (Q306349) (← links)
- Generalized packing designs (Q385379) (← links)
- On the directed Oberwolfach problem with equal cycle lengths (Q405089) (← links)
- On the Hamilton-Waterloo problem with cycle lengths of distinct parities (Q1744749) (← links)
- On the Oberwolfach problem for single-flip 2-factors via graceful labelings (Q2120828) (← links)
- Cops that surround a robber (Q2197471) (← links)
- Cycle decompositions of complete digraphs (Q2227833) (← links)
- The Hamilton-Waterloo problem with even cycle lengths (Q2319702) (← links)
- Colouring even cycle systems (Q2470468) (← links)
- Cops and Robbers on Graphs Based on Designs (Q2864796) (← links)
- Orthogonally Resolvable Cycle Decompositions (Q2950653) (← links)
- Generalized covering designs and clique coverings (Q3100732) (← links)
- Coloring 4-cycle systems (Q3376671) (← links)
- Closed trail decompositions of complete equipartite graphs (Q3578148) (← links)
- On the directed Oberwolfach Problem with equal cycle lengths: the odd case (Q4616108) (← links)
- On the Hamilton–Waterloo problem with odd cycle lengths (Q4642157) (← links)
- (Q4990136) (← links)
- On the generalized Oberwolfach problem (Q5217059) (← links)
- On the spouse‐loving variant of the Oberwolfach problem (Q5225097) (← links)
- On the Hamilton–Waterloo Problem with Odd Orders (Q5349281) (← links)
- Mutually orthogonal cycle systems (Q5871595) (← links)
- The firebreak problem (Q6065343) (← links)
- Constructing uniform 2-factorizations via row-sum matrices: solutions to the Hamilton-Waterloo problem (Q6071955) (← links)
- The edge‐connectivity of vertex‐transitive hypergraphs (Q6143385) (← links)
- Cyclic cycle systems of the complete multipartite graph (Q6185560) (← links)
- On equitably 2-colourable odd cycle decompositions (Q6513275) (← links)
- Extending Graph Burning to Hypergraphs (Q6524281) (← links)
- Weak colourings of Kirkman triple systems (Q6529796) (← links)
- On equitably 2-colourable odd cycle decompositions (Q6584894) (← links)
- A survey on constructive methods for the Oberwolfach problem and its variants (Q6613359) (← links)
- Existential closure in line graphs (Q6616441) (← links)
- An introduction to the deduction number (Q6731741) (← links)
- Existential Closure in Uniform Hypergraphs (Q6735667) (← links)
- On the spouse-loving variant of the Oberwolfach problem (Q6738777) (← links)
- Proportion-Based Hypergraph Burning (Q6740174) (← links)
- Packing Designs with large block size (Q6751100) (← links)
- Deduction, Constrained Zero Forcing, and Constrained Searching (Q6751180) (← links)
