A. Burgess

activity

20102024

most citedCops that surround a robber

13 citations · 35 across the 16 of their papers we have counts for

collaborators

Showing 2018Show all

2 papers · 1 filter

math.CO2018

The Hamilton-Waterloo Problem with even cycle lengths

A. C. Burgess, P. Danziger, T. Traetta

The Hamilton-Waterloo Problem HWP $(v; m, n; α, β)$ asks for a 2-factorization of the complete graph $K_{v}$ or $K_{v} - I$ , the complete graph with the edges of a 1-factor removed, into $α$ …

math.CO2018

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

Andrea Burgess, Peter Danziger, Tommaso Traetta

Let $K_{v}^{*}$ denote the complete graph $K_{v}$ if $v$ is odd and $K_{v} - I$ , the complete graph with the edges of a 1-factor removed, if $v$ is even. Given non-negative integers $v, M, N…