 | 2011 |
|---|
| 7 |       | Darryn E. Bryant,
Melinda Buchanan,
Daniel Horsley,
Barbara M. Maenhaut,
Victor Scharaschkin:
On the non-existence of pair covering designs with at least as many points as blocks.
Combinatorica 31(5): 507-528 (2011) |
| 6 | | Charles J. Colbourn,
Daniel Horsley,
Christopher McLean:
Compressive Sensing Matrices and Hash Families.
IEEE Transactions on Communications 59(7): 1840-1845 (2011) |
| 5 | | Daniel Horsley:
Maximum packings of the complete graph with uniform length cycles.
Journal of Graph Theory 68(1): 1-7 (2011) |
| 2010 |
|---|
| 4 | | Daniel Horsley,
David A. Pike:
On cycle systems with specified weak chromatic number.
J. Comb. Theory, Ser. A 117(8): 1195-1206 (2010) |
| 3 | | Darryn E. Bryant,
Daniel Horsley:
An asymptotic solution to the cycle decomposition problem for complete graphs.
J. Comb. Theory, Ser. A 117(8): 1258-1284 (2010) |
| 2008 |
|---|
| 2 | | Darryn E. Bryant,
Daniel Horsley:
Packing cycles in complete graphs.
J. Comb. Theory, Ser. B 98(5): 1014-1037 (2008) |
| 2005 |
|---|
| 1 | | Darryn E. Bryant,
Daniel Horsley,
Barbara M. Maenhaut:
Decompositions into 2-regular subgraph and equitable partial cycle decompositions.
J. Comb. Theory, Ser. B 93(1): 67-72 (2005) |
Data released under the ODC-BY 1.0 license — See also our legal information page