PUBLICATIONS Journal Articles and Book Chapters: 2021 [164] Robert Brier and Darryn Bryant, On the Steiner Quadruple System with Ten Points, Bulletin of the Institute of Combinatorics and its Applications, 91 (2021) 115--127. 2020 [163] Darryn Bryant, Ajani De Vas Gunasekara, Daniel Horsley, On determining when small embeddings of partial Steiner triple systems exist, Journal of Combinatorial Designs, 28 (2020) 568--579. 2019 [162] Darryn Bryant, Hao Chuien Hang, Sarada Herke, Hamilton path decompositions of complete multipartite graphs, Journal of Combinatorial Theory Series B, 135 (2019) 1--15. 2018 [161] Duncan Berry, Darryn Bryant, Matthew Dean and Barbara Maenhaut, Uniform decompositions of complete graphs into cycles, Journal of Combinatorial Designs, 26 (2018) 595--615. [160] Darryn Bryant, Sarada Herke, Barbara Maenhaut and Bridget Webb, On Hamilton decompositions of infinite circulant graphs, Journal of Graph Theory, 88 (2018) 434--448. [159] Darryn Bryant, Daniel Horsley, Barbara Maenhaut, Benjamin R. Smith, Decompositions of complete multigraphs into cycles of varying lengths, Journal of Combinatorial Theory Series B, 129 (2018) 79--106. [158] Darryn Bryant, Barbara Maenhaut, Benjamin R. Smith, On Hamilton Decompositions of Line Graphs of Non-Hamiltonian Graphs and Graphs without Separating Transitions, Australasian Journal of Combinatorics, 71 (2018) 537--543. 2017 [157] Darryn Bryant, Charles J Colbourn, Daniel Horsley, Padraig O Cathain, Compressed sensing with combinatorial designs: theory and simulations, IEEE Transactions on Information Theory, 63 (2017), 4850--4859. [156] Darryn Bryant, Charles Colbourn, Daniel Horsley, Ian M. Wanless, Steiner triple systems with high chromatic index, SIAM Journal on Discrete Mathematics, 31 (2017) 2603--2611. 2016 [155] Brian Alspach, Darryn Bryant, Daniel Horsley, Barbara Maenhaut and Victor Scharaschkin, On factorisations of complete graphs into circulant graphs and the Oberwolfach Problem, Ars Mathematica Contemporanea, 11 (2016) 157--173. [154] Darryn Bryant, On Almost-Regular Edge Colourings of Hypergraphs, Electronic Journal of Combinatorics, 23(4), P4.7, (2016) 7pp. [153] Darryn Bryant, Andrea Burgess and Peter Danziger, Decompositions of complete graphs into bipartite 2-regular subgraphs, Electronic Journal of Combinatorics, 23(2), P2.1, (2016) 8pp. 2015 [152] Darryn Bryant and Nicholas Cavenagh, Decomposing graphs of high minimum degree into 4-cycles, Journal of Graph Theory, 79 (2015) 167--177. [151] Darryn Bryant, Peter Danziger and William Pettersson, Bipartite 2-factorisations of complete multipartite graphs, Journal of Graph Theory, 78 (2015) 287--294. [150] Darryn Bryant and Matthew Dean, Vertex-transitive graphs that have no Hamilton decomposition, Journal of Combinatorial Theory Series B, 114 (2015) 237--246. [149] Darryn Bryant and Daniel Horsley, Steiner triple systems without parallel classes, Siam Journal on Discrete Mathematics, 29 (2015) 693--696. [148] Darryn Bryant and Padraig O Cathain, An asymptotic existence result on compressed sensing matrices, Linear Algebra and its Applications, 475 (2015) 134--150. 2014 [147] Brian Alspach, Darryn Bryant and Donald L. Kreher, Vertex-Transitive Graphs Of Prime-Squared Order Are Hamilton-Decomposable, Journal of Combinatorial Designs, 22 (2014) 12--25. [146] Darryn Bryant, Nevena Francetic, Przemyslaw Gordinowicz, David Pike and Pawel Pralet, Brushing without capacity restrictions, Discrete Applied Mathematics, 170 (2014) 33--45. [145] Darryn Bryant, Sarada Herke, Barbara Maenhaut and Wannasiri Wannasit, Decompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphs, Australasian Journal of combinatorics, 60 (2014) 227--254. [144] Darryn Bryant, Daniel Horsley and William Pettersson, Cycle decompositions V: Complete graphs into cycles of arbitrary lengths, Proceedings of the London Mathematical Society, 108 (2014) 1153--1192. 2013 [143] Darryn Bryant, Peter Danziger and Matthew Dean, On the Hamilton-Waterloo Problem for bipartite 2-factors, Journal of Combinatorial Designs, 21 (2013) 60--80. [142] Darryn Bryant and Daniel Horsley, A second infinite family of Steiner triple systems with no almost parallel class, Journal of Combinatorial Theory Series A, 120 (2013) 1851--1854. 2012 [141] P. Adams, D.E. Bryant, A.D. Forbes and T.S. Griggs, Decomposing the complete graph into dodecahedra, Journal of Statistical Planning and Inference, 142 (2012) 1040--1046. [140] Brian Alspach, Darryn Bryant and Danny Dyer, Paley graphs have Hamilton decompositions, Discrete Mathematics, 312 (2012) 113--118. [139] Darryn Bryant, Nicholas J. Cavenagh, Barbara Maenhaut, Kyle Pula and Ian M. Wanless, Non-Extendible Latin Cuboids, SIAM Journal on Discrete Mathematics, 26 (2012) 239--249. [138] Darryn Bryant and Geoffrey Martin, Small embeddings for partial triple systems of odd index, Journal of Combinatorial Theory Series A, 119 (2012) 283--309. 2011 [137] Robert Brier and Darryn Bryant, On the existence and embedding of edge-coloured graph decompositions, Ars Combinatoria, 99 (2011) 445--459. [136] Darryn Bryant, Melinda Buchanan, Daniel Horsley, Barbara Maenhaut and Victor Scharaschkin, On the non-existence of pair covering designs with at least as many points as blocks, Combinatorica 31 (2011) 507--528. [135] Darryn Bryant and Peter Danziger, On bipartite 2-factorisations of Kn - I and the Oberwolfach problem, Journal of Graph Theory, 68 (2011) 22--37. [134] Darryn Bryant, Daniel Horsley, Barbara Maenhaut and Benjamin R. Smith, Cycle decompositions of complete multigraphs, Journal of Combinatorial Designs, 19 (2011) 42--69. 2010 [133] Darryn Bryant, Packing paths in complete graphs, Journal of Combinatorial Theory, Series B, 100 (2010) 206--215. [132] Darryn Bryant and Daniel Horsley, An asymptotic solution to the cycle decomposition problem for complete graphs, Journal of Combinatorial Theory Series A, 117 (2010) 1258--1284. [131] S. G. Hartke, P. R. J. Ostergard, D. Bryant and S. I. El-Zanati, The nonexistence of a ($K_6-e$)-decomposition of the complete graph $K_{29}$, Journal of Combinatorial Designs, 18 (2010) 94--104. [130] Tran T. Tran, Christina Kulis, Steven M. Long, Darryn Bryant, Peter Adams, Mark L. Smythe, Defining scaffold geometries for interacting with proteins: Geometrical classification of secondary structure linking regions, Journal of Computer-Aided Molecular Design, 24, (2010) 917--934. 2009 [129] Robert Brier and Darryn Bryant, Perpendicular rectangular latin arrays, Graphs and Combinatorics, 25, 15-25 (2009). [128] Darryn Bryant, Completing partial commutative quasigroups constructed from partial Steiner triple systems is NP-complete, Discrete Mathematics, 309, 4700-4704 (2009). [127] Darryn Bryant, Melinda Buchanan and Ian M. Wanless, The spectrum for quasigroups with cyclic automorphisms and additional symmetries, Discrete Mathematics, 309, 821-833 (2009). [126] Darryn Bryant, Judith Egan, Barbara Maenhaut, Ian M. Wanless, Indivisible plexes in latin squares, Designs, Codes and Cryptography, 52, 93-105 (2009). [125] Darryn Bryant and Daniel Horsley, A proof of Lindner's conjecture on embeddings of partial Steiner triple systems, Journal of Combinatorial Designs, 17, 63-89 (2009). [124] Darryn Bryant and Daniel Horsley, Decompositions of complete graphs into long cycles, Bulletin of the London Mathematical Society, 41, 927-934 (2009). [123] Darryn Bryant and Geoffrey Martin, Some results on decompositions of low degree circulant graphs, Australasian Journal of Combinatorics, 45, 251-261 (2009). [122] Darryn Bryant and Victor Scharaschkin, Complete solutions to the Oberwolfach problem for an infinite set of orders, Journal of Combinatorial Theory Series B, 99, 904-918 (2009). 2008 [121] Peter Adams, Darryn Bryant and Melinda Buchanan, Completing partial Latin squares with two filled rows and two filled columns, Electronic Journal of Combinatorics, 15(1), R56, 26pp (2008). [120] Peter Adams, Darryn Bryant and Melinda Buchanan, A survey on the existence of G-designs, Journal of Combinatorial Designs, 16, 373-410 (2008). [119] Darryn Bryant and Daniel Horsley, Packing cycles in complete graphs, Journal of Combinatorial Theory, Series B, 98, 1014-1037 (2008). [118] Darryn Bryant and Barbara Maenhaut, Almost regular edge colourings and regular decompositions of complete graphs, Journal of Combinatorial Designs, 16, 499-506 (2008). 2007 [117] Peter Adams, Darryn Bryant and Mary Waterhouse, Some equitably 2-coloured cycle decompositions, Ars Combinatoria, 85, 49-64 (2007). [116] Darryn Bryant, Cycle decompositions of complete graphs, Surveys in Combinatorics 2007 (A. Hilton and J. Talbot Eds.), London Mathematical Society Lecture Note Series 346, Proceedings of the 21st British Combinatorial Conference, Cambridge University Press (2007), 67--97. [115] Darryn Bryant and Melinda Buchanan, Embedding partial totally symmetric quasigroups, Journal of Combinatorial Theory, Series A, 114, 1046-1088 (2007). [114] D. Bryant and S. El-Zanati, Graph Decompositions, in The CRC Handbook of Combinatorial Designs, 2nd Edition, (J. H. Dinitz and C. J. Colbourn Eds) CRC Press, Boca Raton, FL, 477-486 (2007). [113] D. Bryant and C. A. Rodger, Cycle Decompositions, in The CRC Handbook of Combinatorial Designs, 2nd Edition, (J. H. Dinitz and C. J. Colbourn Eds) CRC Press, Boca Raton, FL, 373-382 (2007). [112] Jonathan M. Keith, David B. Hawkes, Jacinta A. Carter, Duncan A.E. Cochran, Peter Adams, Darryn E. Bryant and Keith R. Mitchelson, Sequencing Aided by Mutagenesis Facilitates the De Novo Sequencing of Megabase DNA Fragments by Short Read Lengths, in New High Throughput Technologies for DNA Sequencing and Genomics (K. R. Mitchelson Ed.), Series: Perspectives in Bioanalysis, Volume 2, Elsevier, Amsterdam pp 303--326, 2007. 2006 [111] Peter Adams and Darryn Bryant, Two-factorisations of complete graphs of orders fifteen and seventeen, Australasian Journal of Combinatorics, 35, 113-118 (2006). [110] Peter Adams, Darryn Bryant, Mike Grannell and Terry Griggs, Diagonally switchable 4-cycle systems, Australasian Journal of Combinatorics, 34, 145-152 (2006). [109] Peter Adams, Darryn Bryant and Heather Jordon, Edge-colored cube decompositions, Aequationes Mathematicae, 72, 213-224 (2006). [108] Robert Brier and Darryn Bryant, Varieties of algebras arising from $K$-perfect $m$-cycle systems, Discrete Mathematics, 306, 2038-2046 (2006). [107] Darryn Bryant, Saad I. El-Zanati, Barbara Maenhaut and Charles Vanden Eynden, Decompositions of Complete Graphs into 5-cubes, Journal of Combinatorial Designs, 14, 159-166 (2006). [106] Darryn Bryant and Daniel Horsley, Steiner triple systems with two disjoint subsystems, Journal of Combinatorial Designs, 14, 14-24 (2006). [105] Darryn Bryant and Daniel Horsley, The embedding problem for partial Steiner triple systems, Gazette of the Australian Mathematical Society, 33(2), 111-115 (2006). [104] Darryn Bryant, Barbara Maenhaut and Ian M. Wanless, New families of atomic Latin squares and perfect one-factorisations, Journal of Combinatorial Theory, Series A, 113, 608-624 (2006). [103] D. Cochran, G. Lala, J. Keith, P. Adams, D. Bryant and K. Mitchelson, Sequencing by aligning mutated DNA fragments, in The Frontiers of Biochip Technologies, Springer Publishers, eds. W. L. Xing, J. Cheng, ISBN: 0-387-25568-0 pp231--245 (2006). 2005 [102] Darryn Bryant, Mike Grannell and Terry Griggs, Large sets of cycle systems on nine points, Journal of Combinatorial Mathematics and Combinatorial Computing, 53, 95-102 (2005). [101] Darryn Bryant, Daniel Horsley and Barbara Maenhaut, Decompositions into 2-regular subgraphs and equitable partial cycle decompositions, Journal of Combinatorial Theory, Series B, 93, 67-72 (2005). [100] Darryn Bryant, C. D. Leach and C. A. Rodger, Hamilton decompositions of complete bipartite graphs with a 3-factor leave, Australasian Journal of Combinatorics, 31, 331-336 (2005). [99] Jonathan M. Keith, Peter Adams, Mark A. Ragan and Darryn Bryant, Sampling phylogenetic tree space with the generalized Gibbs sampler, Molecular Phylogenetics and Evolution, 34, 459-468 (2005). 2004 [98] Peter Adams, Darryn Bryant, James Lefevre and Mary Waterhouse, Some equitably 3-colourable cycle decompositions, Discrete Mathematics, 284, 21-35 (2004). [97] Peter Adams, Darryn Bryant, Stephen Long, Mark Smythe and Tran Trung Tran, Virtual drug discovery using graph theory, Bulletin of the Institute of Combinatorics and its Applications, 40, 100-106 (2004). [96] Peter Adams, Darryn Bryant and Barbara Maenhaut, Common multiples of complete graphs and a 4-cycle, Discrete Mathematics, 275, 289-297 (2004). [95] Peter Adams, Darryn Bryant and Barbara Maenhaut, Cube factorisations of complete graphs, Journal of Combinatorial Designs, 12, 381-388 (2004). [94] Darryn Bryant, Hamilton cycle rich two-factorisations of complete graphs, Journal of Combinatorial Designs, 12, 147-155 (2004). [93] Darryn Bryant, Embeddings of partial Steiner triple systems, Journal of Combinatorial Theory, Series A, 106, 77-108 (2004). [92] Darryn Bryant, Mike Grannell, Terry Griggs and Martin Macaj, Configurations in 4-cycle systems, Graphs and Combinatorics, 20, 161-179 (2004). [91] Darryn Bryant and Barbara Maenhaut, Decompositions of complete graphs into triangles and Hamilton cycles, Journal of Combinatorial Designs, 12, 221-232 (2004). [90] Darryn Bryant, Barbara Maenhaut, Kathleen Quinn and Bridget S. Webb, Existence and embeddings of partial Steiner triple systems of order ten with cubic leaves, Discrete Mathematics, 284, 83-95 (2004). [89] Darryn Bryant and C. A. Rodger, On the completion of latin rectangles to symmetric latin squares, Journal of the Australian Mathematical Society, 76, 109-124 (2004). [88] Jonathan M. Keith, Peter Adams, Darryn Bryant, Duncan A.E. Cochran, Gita H. Lala and Keith R. Mitchelson, Algorithms for sequence analysis via mutagenesis, Bioinformatics, 20, 2401-2410 (2004). [87] Jonathan M. Keith, Duncan A.E. Cochran, Gita H. Lala, Peter Adams, Darryn Bryant and Keith R. Mitchelson, Unlocking hidden genomic sequence, Nucleic Acids Research, 32, e35, 9pp (2004). [86] Jonathan M. Keith, Dirk P. Kroese and Darryn Bryant, A Generalised Markov Sampler, Methodology and Computing in Applied Probability, 6, 29-53 (2004). 2003 [85] Peter Adams, Darryn Bryant, Saad I. El-Zanati and Heather Gavlas, Factorizations of the complete graph into C_5-factors and 1-factors, Graphs and Combinatorics, 19, 289-296 (2003). [84] Peter Adams, Darryn Bryant, Saad I. El-Zanati, Charles Vanden Eynden and Barbara Maenhaut, Least common multiples of cubes, Bulletin of the Institute of Combinatorics and its Applications, 38, 45-49 (2003). [83] Darryn Bryant, Heather Gavlas and Alan Chi Hung Ling, Skolem-type Difference Sets for Cycle Systems, Electronic Journal of Combinatorics, 10(1), R38, 12pp (2003). [82] Darryn Bryant, Mike Grannell and Terry Griggs, Large sets of large sets of Steiner triple systems of order 9, Utilitas Mathematica, 64, 115-118 (2003). [81] Darryn Bryant, Mike Grannell, Terry Griggs and Barbara Maenhaut, On the volume of 4-cycle trades, Graphs and Combinatorics, 19, 53-63 (2003). [80] Darryn Bryant and Barbara Maenhaut, Common multiples of complete graphs, Proceedings of the London Mathematical Society, 86, 302-326 (2003). [79] Jonathan M. Keith, Peter Adams, Darryn Bryant, Keith R. Mitchelson, Duncan A.E. Cochran, Gita H. Lala, Inferring an original sequence from erroneous copies: two approaches, Asia-Pacific BioTech News, 7, 107-114 (2003). 2002 [78] Peter Adams, Elizabeth J. Billington, Darryn E. Bryant and Saad I. El-Zanati, On the Hamilton-Waterloo Problem, Graphs and Combinatorics, 18, 31-51 (2002). [77] Peter Adams, Elizabeth J. Billington, Darryn E. Bryant and E. S. Mahmoodian, The three-way intersection problem for latin squares, Discrete Mathematics, 243, 1-19 (2002). [76] Peter Adams, Elizabeth J. Billington, Darryn E. Bryant and E. S. Mahmoodian, On the possible volumes of $\mu$-way latin trades, Aequationes Mathematicae, 63, 303-320 (2002). [75] Peter Adams, Darryn Bryant and Heather Gavlas, Decompositions of the complete graph into small 2-regular graphs, Journal of Combinatorial Mathematics and Combinatorial Computing, 43, 135-146 (2002). [74] Darryn Bryant, Another quick proof that $K_{10}\neq P+P+P$, Bulletin of the Institute of Combinatorics and its Applications 34, 86 (2002). [73] Darryn Bryant, A conjecture on small embeddings of partial Steiner triple systems, Journal of Combinatorial Designs, 10, 313-321 (2002). [72] Darryn Bryant, Y. Chang, C. A. Rodger and R. Wei, Two Dimensional Balanced Sampling Plans Excluding Contiguous Units, Communications in Statistics - Theory and Methods, 31, 1441-1455 (2002). [71] Darryn E. Bryant, Saad El-Zanati and Charles Vanden Eynden, Factorizations of and by powers of complete graphs, Discrete Mathematics, 243, 201-205 (2002). [70] Darryn E. Bryant and Hung-Lin Fu, C_4-saturated bipartite graphs, Discrete Mathematics, 259, 263-268 (2002). [69] Darryn Bryant and Abdollah Khodkar, Orthogonal quasigroups associated with m-cycle systems, Bulletin of the Institute of Combinatorics and its Applications, 36, 109-112 (2002). [68] Darryn Bryant, Barbara M. Maenhaut and Ian M. Wanless, A family of perfect factorisations of complete bipartite graphs, Journal of Combinatorial Theory, Series A, 98, 328-342 (2002). [67] Jonathan M. Keith, Peter Adams, Darryn Bryant, Dirk P. Kroese, Keith R. Mitchelson, Duncan A. E. Cochran and Gita H. Lala, A Simulated Annealing Algorithm For Finding Consensus Sequences, Bioinformatics, 18, 1494-1499 (2002). [66] Tran Trung Tran, Darryn Bryant and Mark Smythe, A subset-oriented algorithm for minimizing the number of steps required for synthesis of cyclic-peptide libraries, Computers and Chemistry, 26, 113-117 (2002). 2001 [65] Peter Adams, Elizabeth J. Billington, Darryn E. Bryant and A. Khodkar, The $\mu$-way intersection problem for $m$-cycle systems, Discrete Mathematics, 231, 27-56 (2001). [64] Peter Adams and Darryn E. Bryant, The $mu$-way intersection problem for cubes, Australasian Journal of Combinatorics, 23, 87-100 (2001). [63] Peter Adams, Darryn Bryant and Sean Byrnes, Applications of Graph Theory in DNA Sequencing by Hybridization, Bulletin of the Institute of Combinatorics and its Applications, 31, 13-20 (2001). [62] Darryn E. Bryant, On the Oberwolfach problem with two similar length cycles, Graphs and Combinatorics, 17, 199-206 (2001). [61] Darryn Bryant, 5-cycle systems of $\lambda (K_v-K_u)$, Journal of Combinatorial Mathematics and Combinatorial Computing 38, 161-175 (2001). [60] Darryn E. Bryant, Saad El-Zanati and Charles Vanden Eynden, Star factorizations of graph products, Journal of Graph Theory, 36, 59-66 (2001). [59] Darryn E. Bryant, Saad El-Zanati, Charles Vanden Eynden and Dean G. Hoffman, Star decompositions of cubes, Graphs and Combinatorics, 17, 55-59 (2001). [58] Darryn E. Bryant and A. Khodkar, On the intersection problem for 1-factorizations and near 1-factorizations of $K_v$, Utilitas Mathematica 60, 209-218 (2001). 2000 [57] Peter Adams, Darryn E. Bryant and A. Khodkar, On Alspach's conjecture with two even cycle lengths, Discrete Mathematics, 223, 1-12 (2000). [56] Peter Adams, Darryn E. Bryant and A. Khodkar, The fine structure of balanced ternary designs with block size three, index three and $\rho_2 = 1,2$, Ars Combinatoria, 56, 299-308 (2000). [55] Peter Adams, Darryn E. Bryant and A. Khodkar, The spectrum problem for lambda-fold Petersen graph designs, Journal of Combinatorial Mathematics and Combinatorial Computing, 34, 159-176 (2000). [54] Peter Adams, Darryn E. Bryant and A. Khodkar, The spectrum problem for closed $m$-trails, $m\leq 10$, Journal of Combinatorial Mathematics and Combinatorial Computing, 34, 223-240 (2000). [53] Peter Adams, Darryn E. Bryant and A. Khodkar, The fine structure of $(v,3)$ directed triple systems: $v\equiv 2$ (mod 3), Ars Combinatoria, 57, 3-11 (2000). [52] Bronwyn J. Battersby, Darryn Bryant, Wim Meutermans, Daniel Matthews, Mark L. Smythe and Matt Trau, Towards Larger Chemical Libraries: Encoding with Fluorescent Colloids in Combinatorial Chemistry, Journal of the American Chemical Society, 122, 2138-2139 (2000). [51] Darryn E. Bryant, S. El-Zanati and C. A. Rodger, Maximal Sets of Hamilton Cycles in $K_{n,n}$, Journal of Graph Theory, 33, 25-31 (2000). [50] Darryn E. Bryant and A. Khodkar, Maximum Packings of $K_v-K_u$ with triples, Ars Combinatoria, 55, 259-270 (2000). [49] Lisbeth Grondahl, Bronwyn J. Battersby, Darryn E. Bryant and Matt Trau, Encoding Combinatorial Libraries: A Novel Application of Fluorescent Silica Colloids, Langmuir, 16, 9709-9715 (2000). 1999 [48] Peter Adams, Darryn E. Bryant and Saad El-Zanati, Packing and covering the complete graph with cubes, Australasian Journal of Combinatorics, 20, 267-288 (1999). [47] Peter Adams, Darryn E. Bryant and A. Khodkar, On the number of repeated triples in balanced ternary designs with index two, Utilitas Mathematica, 55, 55-64 (1999). [46] Elizabeth J. Billington and Darryn E. Bryant, The possible number of cycles in cycle systems, Ars Combinatoria, 52, 65-70 (1999). [45] Darryn E. Bryant, A. Khodkar and Saad I. El-Zanati, Small embeddings for partial $G$-designs when $G$ is bipartite, Bulletin of the Institute of Combinatorics and its Applications, 26, 86-89 (1999). [44] Darryn E. Bryant and Sheila Oates-Williams, Strongly 2-perfect trail systems and related quasigroups, Australasian Journal of Combinatorics, 20, 101-110 (1999). 1998 [43] Peter Adams, Darryn E. Bryant and A. Khodkar, 3,5-cycle decompositions, Journal of Combinatorial Designs, 6, 91-110 (1998). [42] Darryn E. Bryant, Large sets of hamilton cycle and path decompositions, Congressus Numerantium, 135, 147-151 (1998). [41] Darryn Bryant, Phil Diamond and I. G. Vladimirov, Generalized Optimal Lattice Covering of Finite-dimensional Euclidean Space, Linear Algebra and Its Applications, 282, 311-324 (1998). [40] Darryn E. Bryant and A.Khodkar, On orthogonal double covers of graphs, Designs, Codes and Cryptography, 13 (2), 103-105 (1998). [39] Darryn E. Bryant and A. Khodkar, 5-cycle systems of $K_v-F$ with a hole, Utilitas Mathematica, 54, 59-73 (1998). [38] Darryn E. Bryant, Hung-Lin Fu and A. Khodkar, $(m,n)$-cycle systems, Journal of Statistical Planning and Inference, 74, 365-370 (1998). [37] Darryn E. Bryant and Barbara M. Maenhaut, Defining sets of $G$-designs, Australasian Journal of Combinatorics, 17, 257-266 (1998). 1997 [36] Peter Adams and Darryn E. Bryant, The spectrum problem for the Heawood graph, Bulletin of the Institute of Combinatorics and its Applications, 19, 17-22 (1997). [35] Peter Adams and Darryn E. Bryant, $i$-perfect $m$-cycle systems, $m\leq 19$, Aequationes Mathematicae, 53, 275-294 (1997). [34] Peter Adams, Darryn E. Bryant, Saad I. El-Zanati and Charles Vanden Eynden, $d$-cube decompositions of $K_n\setminus K_m$, Graphs and Combinatorics, 13, 1-7 (1997). [33] Peter Adams, Darryn E. Bryant, A. Khodkar and Saad I. El-Zanati, The intersection problem for cubes, Australasian Journal of Combinatorics, 15, 127-134 (1997). [32] Peter Adams, Darryn E. Bryant and A. Khodkar, Uniform 3-factorisations of $K_{10}$, Congressus Numerantium, 127, 23-32 (1997). [31] B. J. Battersby, Darryn E. Bryant and C. A. Rodger, Factorizations of complete multigraphs, Australasian Journal of Combinatorics, 16, 35-43 (1997). [30] Darryn E. Bryant, On the volume of trades in triple systems, Australasian Journal of Combinatorics, 15, 161-176 (1997). [29] Darryn E. Bryant, $2m$-cycle systems of $K_2m+1\setminus C_m$, Graphs and Combinatorics, 13, 227-229 (1997). [28] Darryn E. Bryant and A. Khodkar, A census of (9;1;3,2) balanced ternary designs, Journal of Combinatorial Mathematics and Combinatorial Computing, 23, 153-160 (1997). [27] Darryn E. Bryant and Sheila Oates-Williams, Strongly 2-perfect cycle systems and their quasigroups, Discrete Mathematics, 167/168, 167-174 (1997). [26] Darryn E. Bryant, C. A. Rodger and Erin R. Spicer, Embeddings of $m$-cycle systems and incomplete $m$-cycle systems: $m\leq 14$, Discrete Mathematics, 171, 55-75 (1997). 1996 [25] Peter Adams, Elizabeth J. Billington and Darryn E. Bryant, Partitionable perfect cycle systems with cycle lengths 6 and 8, Discrete Mathematics, 149, 1-9 (1996). [24] Peter Adams, Elizabeth J. Billington and Darryn E. Bryant, The spectrum for lambda-fold Steiner pentagon systems, Journal of Statistical Planning and Inference, 56, 3-15 (1996). [23] Peter Adams and Darryn E. Bryant, Decomposing the complete graph into Platonic graphs, Bulletin of the Institute of Combinatorics and its Applications, 17, 19-26 (1996). [22] Peter Adams and Darryn E. Bryant, The spectrum problem for the Petersen graph, Journal of Graph Theory, 22, 175-180 (1996). [21] Peter Adams, Darryn E. Bryant and A. Khodkar, On the existence of super-simple designs with block size 4, Aequationes Mathematicae, 51, 230-246 (1996). [20] Darryn E. Bryant, A special class of nested Steiner triple systems, Discrete Mathematics, 152, 315-320 (1996). [19] Darryn E. Bryant, D. G. Hoffman and C. A. Rodger, 5-cycle systems with holes, Designs Codes and Cryptography, 8, 103-108 (1996). [18] Darryn E. Bryant and C. C. Lindner, 2-perfect directed $m$-cycle systems can be equationally defined for $m = 3,4$ and 5 only, Journal of Statistical Planning and Inference, 56, 57-63 (1996). [17] Darryn E. Bryant and C. C. Lindner, 2-perfect $m$-cycle systems can be equationally defined for $m = 3,5$ and 7 only, Algebra Universalis, 35 (1) 1-7 (1996). 1995 [16] Peter Adams and Darryn E. Bryant, Cyclically generated closed $m$-trail systems of order $2m+1$, $m\leq 10$, Journal of Combinatorial Mathematics and Combinatorial Computing, 17, 3-19 (1995). [15] Peter Adams, Darryn E. Bryant and S. El-Zanati, Lambda-fold cube decompositions, Australasian Journal of Combinatorics, 11, 197-210 (1995). [14] Darryn E. Bryant, A note on varieties of groupoids arising from $m$-cycle systems, Journal of Algebraic Combinatorics, 4(3), 197-200 (1995). [13] Darryn E. Bryant, Homomorphisms of groupoids related to graph decompositions, Journal of Combinatorial Mathematics and Combinatorial Computing, 17, 129-136 (1995). [12] Darryn E. Bryant and Peter Adams, Decomposing the complete graph into cycles of many lengths, Graphs and Combinatorics, 11, 97-102 (1995). [11] Darryn E. Bryant and Sheila Oates-Williams, Mendelsohn designs associated with a class of idempotent quasigroups, Discrete Mathematics, 138, 161-167 (1995). 1994 [10] Darryn E. Bryant, Decompositions of directed graphs with loops and related algebras, Ars Combinatoria, 38, 129-136 (1994). [9] Darryn E. Bryant, Saad I. El-Zanati and Robert B. Gardner, Decompositions of $K_{m,n}$ and $K_n$ into cubes, Australasian Journal of Combinatorics, 9, 285-290 (1994). [8] Darryn E. Bryant and Sheila Oates-Williams, Constructing identities for finite quasigroups, Communications in Algebra, 22(5), 1783-1795 (1994). [7] Darryn E. Bryant and C. A. Rodger, On the Doyen-Wilson theorem for $m$-cycle systems, Journal of Combinatorial Designs, 2(4), 253-271 (1994). [6] Darryn E. Bryant and C. A. Rodger, The Doyen-Wilson theorem extended to 5-cycles, Journal of Combinatorial Theory, Series A, 68, 218-225 (1994). 1993 [5] Darryn E. Bryant, Varieties of quasigroups and related topics, Bulletin of the Australian Mathematical Society, 48, 171-172 (1993). [4] Darryn E. Bryant and Peter Adams, 2-perfect closed $m$-trail systems of the complete directed graph with loops, Australasian Journal of Combinatorics, 8, 127-142 (1993). [3] Alan Rahilly, Cheryl E. Praeger, Anne Penfold Street and Darryn E. Bryant, Half-regular symmetric designs, Australasian Journal of Combinatorics, 8, 1-26 (1993). 1992 [2] Darryn E. Bryant, Varieties of quasigroups arising from 2-perfect $m$-cycle systems, Designs, Codes and Cryptography, 2, 159-168 (1992). [1] Darryn E. Bryant, Varieties of $P$-quasigroups, Australasian Journal of Combinatorics, 6, 229-243 (1992). Patents: [1] Darryn Bryant and Matt Trau, Carrier-reporter bead assemblies for solid-phase synthesis of combinatorial libraries, WO9924458 (1999). [2] Bronwyn Battersby, Darryn Bryant and Matt Trau, Carriers for combinatorial compound libraries, WO0032542 (2000). [3] Peter Adams, Darryn Bryant, Jonathan Keith, and Keith Mitchelson, A method for sequence analysis, PCT/AU02/00397 (2002). [4] Peter Adams, Darryn Bryant, Stephen Long, Mark Smythe and Tran Trung Tran, Common protein surface shapes, PCT/AU03/00137 (2003).