default search action
Nicholas J. Cavenagh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
- [j49]Fahim Rahim, Nicholas J. Cavenagh:
Mutually orthogonal frequency rectangles. Discret. Math. 346(12): 113606 (2023) - 2022
- [j48]Andrea C. Burgess, Nicholas J. Cavenagh, David A. Pike:
Mutually orthogonal cycle systems. Ars Math. Contemp. 23(2) (2022) - 2021
- [j47]Nicholas J. Cavenagh, Adam Mammoliti, Ian M. Wanless
:
Maximal sets of mutually orthogonal frequency squares. Des. Codes Cryptogr. 89(3): 525-558 (2021) - 2020
- [j46]Thomas Britz
Mutually Orthogonal Binary Frequency Squares. Electron. J. Comb. 27(3): 3 (2020) - [j45]Kevin Burrage, Diane M. Donovan, Nicholas J. Cavenagh, Emine Sule Yazici
Globally simple Heffter arrays H(n;k) when k≡0, 3(mod4). Discret. Math. 343(5): 111787 (2020) - 2019
- [j44]Nicholas J. Cavenagh, Jeffery H. Dinitz, Diane M. Donovan, Emine Sule Yazici
The existence of square non-integer Heffter arrays. Ars Math. Contemp. 17(2): 369-395 (2019) - 2018
- [j43]Nicholas J. Cavenagh
Balanced diagonals in frequency squares. Discret. Math. 341(8): 2293-2301 (2018) - [j42]Nicholas J. Cavenagh
Lower Bounds on the Sizes of Defining Sets in Full n-Latin Squares and Full Designs. Graphs Comb. 34(4): 571-577 (2018) - 2017
- [j41]Nicholas J. Cavenagh, Ian M. Wanless:
Latin Squares with No Transversals. Electron. J. Comb. 24(2): 2 (2017) - [j40]Nicholas J. Cavenagh, Diane M. Donovan, Fatih Demirkale:
Orthogonal Trades in Complete Sets of MOLS. Electron. J. Comb. 24(3): 3 (2017) - [j39]Nicholas J. Cavenagh
Subcubic trades in Steiner triple systems. Discret. Math. 340(6): 1351-1358 (2017) - 2016
- [j38]Reshma Ramadurai, Nicholas J. Cavenagh:
On the distances between Latin squares and the smallest defining set size. Electron. Notes Discret. Math. 54: 15-20 (2016) - [j37]Nicholas J. Cavenagh, Vaipuna Raass:
Critical Sets of Full n-Latin Squares. Graphs Comb. 32(2): 543-552 (2016) - 2015
- [j36]Nicholas J. Cavenagh, Jaromy Kuhl:
On the chromatic index of Latin squares. Contributions Discret. Math. 10(2) (2015) - [j35]Thomas Britz
Maximal Partial Latin Cubes. Electron. J. Comb. 22(1): 1 (2015) - [j34]Nicholas J. Cavenagh:
Decomposing Dense Bipartite Graphs into 4-Cycles. Electron. J. Comb. 22(1): 1 (2015) - [j33]Darryn E. Bryant
Decomposing Graphs of High Minimum Degree into 4-Cycles. J. Graph Theory 79(3): 167-177 (2015) - 2013
- [j32]R. Julian R. Abel, Nicholas J. Cavenagh, Jaromy Kuhl:
Induced Subarrays of Latin Squares Without Repeated Symbols. Electron. J. Comb. 20(1): 44 (2013) - 2012
- [j31]Diane M. Donovan, James G. Lefevre, Thomas A. McCourt, Nicholas J. Cavenagh, Abdollah Khodkar:
Identifying flaws in the security of critical sets in latin squares via triangulations. Australas. J Comb. 52: 243-268 (2012) - [j30]Benjamin R. Smith, Nicholas J. Cavenagh:
Decomposing complete equipartite graphs into odd square-length cycles: Number of parts even. Discret. Math. 312(10): 1611-1622 (2012) - [j29]Elizabeth J. Billington, Nicholas J. Cavenagh, Abdollah Khodkar:
Complete sets of metamorphoses: Twofold 4-cycle systems into twofold 6-cycle systems. Discret. Math. 312(16): 2438-2445 (2012) - [j28]Darryn E. Bryant
Nonextendible Latin Cuboids. SIAM J. Discret. Math. 26(1): 239-249 (2012) - 2011
- [j27]Nicholas J. Cavenagh, Carlo Hämäläinen, James G. Lefevre
Multi-latin squares. Discret. Math. 311(13): 1164-1171 (2011) - 2010
- [j26]Nicholas J. Cavenagh:
Avoidable Partial Latin Squares Of Order 4m+1. Ars Comb. 95 (2010) - [j25]Benjamin R. Smith, Nicholas J. Cavenagh:
Decomposing Complete Equipartite Graphs into Short Odd Cycles. Electron. J. Comb. 17(1) (2010) - [j24]Nicholas J. Cavenagh, Ian M. Wanless:
On the number of transversals in Cayley tables of cyclic groups. Discret. Appl. Math. 158(2): 136-146 (2010) - [j23]Elizabeth J. Billington, Nicholas J. Cavenagh, Benjamin R. Smith:
Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts. Discret. Math. 310(2): 241-254 (2010) - 2009
- [j22]Elizabeth J. Billington, Nicholas J. Cavenagh, Benjamin R. Smith:
Path and cycle decompositions of complete equipartite graphs: Four parts. Discret. Math. 309(10): 3061-3073 (2009) - [j21]Nicholas J. Cavenagh, Carlo Hämäläinen, Adrian M. Nelson:
On completing three cyclically generated transversals to a latin square. Finite Fields Their Appl. 15(3): 294-303 (2009) - 2008
- [j20]Nicholas J. Cavenagh, Diane M. Donovan
Minimal homogeneous Steiner 2-(v, 3) trades. Discret. Math. 308(5-6): 741-752 (2008) - [j19]Nicholas J. Cavenagh, Diane M. Donovan
When is a partial Latin square uniquely completable, but not its completable product? Discret. Math. 308(13): 2830-2843 (2008) - [j18]Nicholas J. Cavenagh, Ales Drápal
Latin bitrades derived from groups. Discret. Math. 308(24): 6189-6202 (2008) - [j17]Elizabeth J. Billington, Nicholas J. Cavenagh:
Sparse Graphs which Decompose into Closed Trails of Arbitrary Lengths. Graphs Comb. 24(3): 129-147 (2008) - [j16]Nicholas J. Cavenagh, Petr Lisonek:
Planar Eulerian triangulations are equivalent to spherical Latin bitrades. J. Comb. Theory A 115(1): 193-197 (2008) - [j15]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
- [j14]Nicholas J. Cavenagh, Diane M. Donovan, Abdollah Khodkar:
On The Spectrum Of Critical Sets In Back Circulant Latin Squares. Ars Comb. 82 (2007) - 2006
- [j13]Nicholas J. Cavenagh:
A lower bound for the size of a critical set in the back circulant latin square. Australas. J Comb. 36: 231-240 (2006) - [j12]Nicholas J. Cavenagh, Diana Combe, Adrian M. Nelson:
Edge-Magic Group Labellings of Countable Graphs. Electron. J. Comb. 13(1) (2006) - [j11]Nicholas J. Cavenagh, Diane M. Donovan
Minimal homogeneous latin trades. Discret. Math. 306(17): 2047-2055 (2006) - 2005
- [j10]Nicholas J. Cavenagh, Diane M. Donovan, Ales Drápal:
4-homogeneous latin trades. Australas. J Comb. 32: 285-304 (2005) - [j9]Nicholas J. Cavenagh, Diane M. Donovan
3-Homogeneous latin trades. Discret. Math. 300(1-3): 57-70 (2005) - 2004
- [j8]Nicholas J. Cavenagh, Diane M. Donovan
Constructing and deconstructing latin trades. Discret. Math. 284(1-3): 97-105 (2004) - [j7]Nicholas J. Cavenagh, Saad I. El-Zanati, Abdollah Khodkar, Charles Vanden Eynden:
On a generalization of the Oberwolfach problem. J. Comb. Theory A 106(2): 255-275 (2004) - 2003
- [j6]Nicholas J. Cavenagh:
Latin Trade Algorithms and the Smallest Critical Set in a Latin Square. J. Autom. Lang. Comb. 8(4): 567-578 (2003) - 2002
- [j5]Nicholas J. Cavenagh:
A new bound on the size of the largest 2-critical set in a latin square. Australas. J Comb. 26: 255-264 (2002) - [j4]Nicholas J. Cavenagh:
Further decompositions of complete tripartite graphs into 5-cycles. Discret. Math. 256(1-2): 55-81 (2002) - 2000
- [j3]Nicholas J. Cavenagh, Elizabeth J. Billington:
On decomposing complete tripartite graphs into 5-cycles. Australas. J Comb. 22: 41-62 (2000) - [j2]Nicholas J. Cavenagh, Elizabeth J. Billington:
Decompositions of Complete Multipartite Graphs into Cycles of Even Length. Graphs Comb. 16(1): 49-65 (2000) - 1998
- [j1]Nicholas J. Cavenagh:
Decompositions of complete tripartite graphs into k-cycles. Australas. J Comb. 18: 193-200 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: