Mutually orthogonal frequency rectangles. - Rahim, Fahim; Cavenagh, Nicholas J. (Discret. Math., 2023)

Mutually orthogonal cycle systems. - Burgess, Andrea C.; Cavenagh, Nicholas J.; Pike, David A. (Ars Math. Contemp., 2022)

Maximal sets of mutually orthogonal frequency squares. - Cavenagh, Nicholas J.; Mammoliti, Adam; Wanless, Ian M. (Des. Codes Cryptogr., 2021)

Mutually Orthogonal Binary Frequency Squares. - Britz, Thomas; Cavenagh, Nicholas J.; Mammoliti, Adam; Wanless, Ian M. (Electron. J. Comb., 2020)

Globally simple Heffter arrays H(n;k) when k≡0, 3(mod4). - Burrage, Kevin; Donovan, Diane M.; Cavenagh, Nicholas J.; Yazici, Emine Sule (Discret. Math., 2020)

The existence of square non-integer Heffter arrays. - Cavenagh, Nicholas J.; Dinitz, Jeffery H.; Donovan, Diane M.; Yazici, Emine Sule (Ars Math. Contemp., 2019)

Balanced diagonals in frequency squares. - Cavenagh, Nicholas J.; Mammoliti, Adam (Discret. Math., 2018)

Lower Bounds on the Sizes of Defining Sets in Full n-Latin Squares and Full Designs. - Cavenagh, Nicholas J. (Graphs Comb., 2018)

Latin Squares with No Transversals. - Cavenagh, Nicholas J.; Wanless, Ian M. (Electron. J. Comb., 2017)

Orthogonal Trades in Complete Sets of MOLS. - Cavenagh, Nicholas J.; Donovan, Diane M.; Demirkale, Fatih (Electron. J. Comb., 2017)

Subcubic trades in Steiner triple systems. - Cavenagh, Nicholas J.; Griggs, Terry S. (Discret. Math., 2017)

On the distances between Latin squares and the smallest defining set size. - Ramadurai, Reshma; Cavenagh, Nicholas J. (Electron. Notes Discret. Math., 2016)

Critical Sets of Full n-Latin Squares. - Cavenagh, Nicholas J.; Raass, Vaipuna (Graphs Comb., 2016)

On the chromatic index of Latin squares. - Cavenagh, Nicholas J.; Kuhl, Jaromy (Contributions Discret. Math., 2015)

Maximal Partial Latin Cubes. - Britz, Thomas; Cavenagh, Nicholas J.; Sørensen, Henrik Kragh (Electron. J. Comb., 2015)

Decomposing Dense Bipartite Graphs into 4-Cycles. - Cavenagh, Nicholas J. (Electron. J. Comb., 2015)

Decomposing Graphs of High Minimum Degree into 4-Cycles. - Bryant, Darryn E.; Cavenagh, Nicholas J. (J. Graph Theory, 2015)

Induced Subarrays of Latin Squares Without Repeated Symbols. - Abel, R. Julian R.; Cavenagh, Nicholas J.; Kuhl, Jaromy (Electron. J. Comb., 2013)

Identifying flaws in the security of critical sets in latin squares via triangulations. - Donovan, Diane M.; Lefevre, James G.; McCourt, Thomas A.; Cavenagh, Nicholas J.; Khodkar, Abdollah (Australas. J Comb., 2012)

Decomposing complete equipartite graphs into odd square-length cycles: Number of parts even. - Smith, Benjamin R.; Cavenagh, Nicholas J. (Discret. Math., 2012)

Complete sets of metamorphoses: Twofold 4-cycle systems into twofold 6-cycle systems. - Billington, Elizabeth J.; Cavenagh, Nicholas J.; Khodkar, Abdollah (Discret. Math., 2012)

Nonextendible Latin Cuboids. - Bryant, Darryn E.; Cavenagh, Nicholas J.; Maenhaut, Barbara M.; Pula, Kyle; Wanless, Ian M. (SIAM J. Discret. Math., 2012)

Multi-latin squares. - Cavenagh, Nicholas J.; Hämäläinen, Carlo; Lefevre, James G.; Stones, Douglas S. (Discret. Math., 2011)

Avoidable Partial Latin Squares Of Order 4m+1. - Cavenagh, Nicholas J. (Ars Comb., 2010)

Decomposing Complete Equipartite Graphs into Short Odd Cycles. - Smith, Benjamin R.; Cavenagh, Nicholas J. (Electron. J. Comb., 2010)

On the number of transversals in Cayley tables of cyclic groups. - Cavenagh, Nicholas J.; Wanless, Ian M. (Discret. Appl. Math., 2010)

Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts. - Billington, Elizabeth J.; Cavenagh, Nicholas J.; Smith, Benjamin R. (Discret. Math., 2010)

Path and cycle decompositions of complete equipartite graphs: Four parts. - Billington, Elizabeth J.; Cavenagh, Nicholas J.; Smith, Benjamin R. (Discret. Math., 2009)

On completing three cyclically generated transversals to a latin square. - Cavenagh, Nicholas J.; Hämäläinen, Carlo; Nelson, Adrian M. (Finite Fields Their Appl., 2009)

Minimal homogeneous Steiner 2-(v, 3) trades. - Cavenagh, Nicholas J.; Donovan, Diane M.; Yazici, Emine Sule (Discret. Math., 2008)

When is a partial Latin square uniquely completable, but not its completable product? - Cavenagh, Nicholas J.; Donovan, Diane M.; Khodkar, Abdollah; Rees, G. H. John van (Discret. Math., 2008)

Latin bitrades derived from groups. - Cavenagh, Nicholas J.; Drápal, Ales; Hämäläinen, Carlo (Discret. Math., 2008)

Sparse Graphs which Decompose into Closed Trails of Arbitrary Lengths. - Billington, Elizabeth J.; Cavenagh, Nicholas J. (Graphs Comb., 2008)

Planar Eulerian triangulations are equivalent to spherical Latin bitrades. - Cavenagh, Nicholas J.; Lisonek, Petr (J. Comb. Theory A, 2008)

The cycle structure of two rows in a random Latin square. - Cavenagh, Nicholas J.; Greenhill, Catherine S.; Wanless, Ian M. (Random Struct. Algorithms, 2008)

On The Spectrum Of Critical Sets In Back Circulant Latin Squares. - Cavenagh, Nicholas J.; Donovan, Diane M.; Khodkar, Abdollah (Ars Comb., 2007)

A lower bound for the size of a critical set in the back circulant latin square. - Cavenagh, Nicholas J. (Australas. J Comb., 2006)

Edge-Magic Group Labellings of Countable Graphs. - Cavenagh, Nicholas J.; Combe, Diana; Nelson, Adrian M. (Electron. J. Comb., 2006)

Minimal homogeneous latin trades. - Cavenagh, Nicholas J.; Donovan, Diane M.; Yazici, Emine Sule (Discret. Math., 2006)

4-homogeneous latin trades. - Cavenagh, Nicholas J.; Donovan, Diane M.; Drápal, Ales (Australas. J Comb., 2005)

3-Homogeneous latin trades. - Cavenagh, Nicholas J.; Donovan, Diane M.; Drápal, Ales (Discret. Math., 2005)

Constructing and deconstructing latin trades. - Cavenagh, Nicholas J.; Donovan, Diane M.; Drápal, Ales (Discret. Math., 2004)

On a generalization of the Oberwolfach problem. - Cavenagh, Nicholas J.; El-Zanati, Saad I.; Khodkar, Abdollah; Eynden, Charles Vanden (J. Comb. Theory A, 2004)

Latin Trade Algorithms and the Smallest Critical Set in a Latin Square. - Cavenagh, Nicholas J. (J. Autom. Lang. Comb., 2003)

A new bound on the size of the largest 2-critical set in a latin square. - Cavenagh, Nicholas J. (Australas. J Comb., 2002)

Further decompositions of complete tripartite graphs into 5-cycles. - Cavenagh, Nicholas J. (Discret. Math., 2002)

On decomposing complete tripartite graphs into 5-cycles. - Cavenagh, Nicholas J.; Billington, Elizabeth J. (Australas. J Comb., 2000)

Decompositions of Complete Multipartite Graphs into Cycles of Even Length. - Cavenagh, Nicholas J.; Billington, Elizabeth J. (Graphs Comb., 2000)

Decompositions of complete tripartite graphs into k-cycles. - Cavenagh, Nicholas J. (Australas. J Comb., 1998)