 | 2012 |
| 23 |  | Benjamin R. Smith,
Nicholas J. Cavenagh:
Decomposing complete equipartite graphs into odd square-length cycles: Number of parts even.
Discrete Mathematics 312(10): 1611-1622 (2012) |
| 22 |  | Darryn E. Bryant,
Nicholas J. Cavenagh,
Barbara M. Maenhaut,
Kyle Pula,
Ian M. Wanless:
Nonextendible Latin Cuboids.
SIAM J. Discrete Math. 26(1): 239-249 (2012) |
| 2011 |
| 21 |  | Nicholas J. Cavenagh,
Carlo Hämäläinen,
James G. Lefevre,
Douglas S. Stones:
Multi-latin squares.
Discrete Mathematics 311(13): 1164-1171 (2011) |
| 2010 |
| 20 |  | Nicholas J. Cavenagh,
Ian M. Wanless:
On the number of transversals in Cayley tables of cyclic groups.
Discrete Applied Mathematics 158(2): 136-146 (2010) |
| 19 |  | Elizabeth J. Billington,
Nicholas J. Cavenagh,
Benjamin R. Smith:
Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts.
Discrete Mathematics 310(2): 241-254 (2010) |
| 18 |  | Benjamin R. Smith,
Nicholas J. Cavenagh:
Decomposing Complete Equipartite Graphs into Short Odd Cycles.
Electr. J. Comb. 17(1): (2010) |
| 2009 |
| 17 |  | Elizabeth J. Billington,
Nicholas J. Cavenagh,
Benjamin R. Smith:
Path and cycle decompositions of complete equipartite graphs: Four parts.
Discrete Mathematics 309(10): 3061-3073 (2009) |
| 16 |  | Nicholas J. Cavenagh,
Carlo Hämäläinen,
Adrian M. Nelson:
On completing three cyclically generated transversals to a latin square.
Finite Fields and Their Applications 15(3): 294-303 (2009) |
| 2008 |
| 15 |  | Nicholas J. Cavenagh,
Diane Donovan,
Abdollah Khodkar,
G. H. John Van Rees:
When is a partial Latin square uniquely completable, but not its completable product?
Discrete Mathematics 308(13): 2830-2843 (2008) |
| 14 |  | Nicholas J. Cavenagh,
Ales Drápal,
Carlo Hämäläinen:
Latin bitrades derived from groups.
Discrete Mathematics 308(24): 6189-6202 (2008) |
| 13 |  | Nicholas J. Cavenagh,
Diane Donovan,
Emine Sule Yazici:
Minimal homogeneous Steiner 2-(v, 3) trades.
Discrete Mathematics 308(5-6): 741-752 (2008) |
| 12 |  | Elizabeth J. Billington,
Nicholas J. Cavenagh:
Sparse Graphs which Decompose into Closed Trails of Arbitrary Lengths.
Graphs and Combinatorics 24(3): 129-147 (2008) |
| 11 |  | Nicholas J. Cavenagh,
Petr Lisonek:
Planar Eulerian triangulations are equivalent to spherical Latin bitrades.
J. Comb. Theory, Ser. A 115(1): 193-197 (2008) |
| 10 |  | Nicholas J. Cavenagh,
Catherine S. Greenhill,
Ian M. Wanless:
The cycle structure of two rows in a random Latin square.
Random Struct. Algorithms 33(3): 286-309 (2008) |
| 2007 |
| 9 |  | Nicholas J. Cavenagh,
Diane Donovan,
Abdollah Khodkar:
On The Spectrum Of Critical Sets In Back Circulant Latin Squares.
Ars Comb. 82: (2007) |
| 2006 |
| 8 |  | Nicholas J. Cavenagh,
Diane Donovan,
Emine Sule Yazici:
Minimal homogeneous latin trades.
Discrete Mathematics 306(17): 2047-2055 (2006) |
| 7 |  | Nicholas J. Cavenagh,
Diana Combe,
Adrian M. Nelson:
Edge-Magic Group Labellings of Countable Graphs.
Electr. J. Comb. 13(1): (2006) |
| 2005 |
| 6 |  | Nicholas J. Cavenagh,
Diane Donovan,
Ales Drápal:
3-Homogeneous latin trades.
Discrete Mathematics 300(1-3): 57-70 (2005) |
| 2004 |
| 5 |  | Nicholas J. Cavenagh,
Diane Donovan,
Ales Drápal:
Constructing and deconstructing latin trades.
Discrete Mathematics 284(1-3): 97-105 (2004) |
| 4 |  | Nicholas J. Cavenagh,
Saad El-Zanati,
Abdollah Khodkar,
Charles Vanden Eynden:
On a generalization of the Oberwolfach problem.
J. Comb. Theory, Ser. A 106(2): 255-275 (2004) |
| 2003 |
| 3 |  | Nicholas J. Cavenagh:
Latin Trade Algorithms and the Smallest Critical Set in a Latin Square.
Journal of Automata, Languages and Combinatorics 8(4): 567-578 (2003) |
| 2002 |
| 2 |  | Nicholas J. Cavenagh:
Further decompositions of complete tripartite graphs into 5-cycles.
Discrete Mathematics 256(1-2): 55-81 (2002) |
| 2000 |
| 1 |  | Nicholas J. Cavenagh,
Elizabeth J. Billington:
Decompositions of Complete Multipartite Graphs into Cycles of Even Length.
Graphs and Combinatorics 16(1): 49-65 (2000) |