Person:385378: Difference between revisions

From MaRDI portal
Person:385378
m AuthorDisambiguator moved page Person:281573 to Andrea C. Burgess: Duplicate
m AuthorDisambiguator moved page Andrea C. Burgess to Andrea C. Burgess: Duplicate
 
(No difference)

Latest revision as of 02:57, 10 December 2023

Available identifiers

zbMath Open burgess.andrea-cWikidataQ102375589 ScholiaQ102375589MaRDI QIDQ385378

List of research outcomes





PublicationDate of PublicationType
Existential closure in line graphs2024-10-09Paper
A survey on constructive methods for the Oberwolfach problem and its variants2024-10-02Paper
On equitably 2-colourable odd cycle decompositions2024-08-08Paper
Cyclic cycle systems of the complete multipartite graph2024-01-29Paper
The edge‐connectivity of vertex‐transitive hypergraphs2024-01-24Paper
The firebreak problem2023-12-11Paper
Constructing uniform 2-factorizations via row-sum matrices: solutions to the Hamilton-Waterloo problem2023-11-29Paper
A survey on constructive methods for the Oberwolfach problem and its variants2023-08-08Paper
Distance-Restricted Firefighting on Finite Graphs2023-06-21Paper
Mutually orthogonal cycle systems2023-01-23Paper
Existential Closure in Line Graphs2022-11-02Paper
Firefighting with a Distance-Based Restriction2022-04-04Paper
On the Oberwolfach problem for single-flip 2-factors via graceful labelings2022-04-01Paper
https://portal.mardi4nfdi.de/entity/Q49901362021-05-28Paper
Cycle decompositions of complete digraphs2021-02-16Paper
Cops that surround a robber2020-08-31Paper
On the generalized Oberwolfach problem2020-02-21Paper
The Hamilton-Waterloo problem with even cycle lengths2019-08-20Paper
On the spouse‐loving variant of the Oberwolfach problem2019-07-19Paper
On the directed Oberwolfach Problem with equal cycle lengths: the odd case2019-01-30Paper
On the Hamilton–Waterloo problem with odd cycle lengths2018-05-22Paper
On the Hamilton-Waterloo problem with cycle lengths of distinct parities2018-04-19Paper
On the Hamilton–Waterloo Problem with Odd Orders2017-08-24Paper
On generalized Howell designs with block size three2016-08-31Paper
Decompositions of complete graphs into bipartite 2-regular subgraphs2016-05-11Paper
Orthogonally Resolvable Cycle Decompositions2015-10-09Paper
On the directed Oberwolfach problem with equal cycle lengths2014-09-04Paper
Generalized packing designs2013-12-02Paper
Cops and Robbers on Graphs Based on Designs2013-11-26Paper
Generalized covering designs and clique coverings2011-11-21Paper
Closed trail decompositions of complete equipartite graphs2010-07-13Paper
Colouring even cycle systems2008-02-14Paper
Coloring 4-cycle systems2006-03-24Paper
On equitably 2-colourable odd cycle decompositionsN/APaper
Extending Graph Burning to HypergraphsN/APaper
Weak colourings of Kirkman triple systemsN/APaper

Research outcomes over time

This page was built for person: Andrea C. Burgess