Daniel Horsley

activity

20122022

most citedDecompositions of complete graphs into cycles of arbitrary lengths

54 citations · 108 across the 24 of their papers we have counts for

collaborators

Showing 2012 · math.COShow all

3 papers · 2 filters

math.CO2012★ 3 cited

On balanced incomplete block designs with specified weak chromatic number

Daniel Horsley, David A. Pike

A weak $c$ -colouring of a balanced incomplete block design (BIBD) is a colouring of the points of the design with $c$ colours in such a way that no block of the design has all of i…

math.CO2012

Decomposing various graphs into short even-length cycles

Daniel Horsley

We prove that a complete bipartite graph can be decomposed into cycles of arbitrary specified lengths provided that the obvious necessary conditions are satisfied, the length of ea…

math.CO2012★ 54 cited

Decompositions of complete graphs into cycles of arbitrary lengths

Darryn Bryant, Daniel Horsley, William Pettersson

We show that the complete graph on $n$ vertices can be decomposed into $t$ cycles of specified lengths $m_{1}, \dots, m_{t}$ if and only if $n$ is odd, $3 \leq m_{i} \leq n$ for $i=1,\ldots…