Darryn E. Bryant

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)

Robert Brier, Darryn E. Bryant: On the existence and embedding of edge-coloured graph decompositions. Ars Comb. 99: 445-459 (2011)

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)

Tran Trung Tran, Christina Kulis, Steven M. Long, Darryn E. 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(11): 917-934 (2010)

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)

Darryn E. Bryant, Judith Egan, Barbara M. Maenhaut, Ian M. Wanless: Indivisible plexes in latin squares. Des. Codes Cryptography 52(1): 93-105 (2009)

Darryn E. Bryant, Melinda Buchanan, Ian M. Wanless: The spectrum for quasigroups with cyclic automorphisms and additional symmetries. Discrete Mathematics 309(4): 821-833 (2009)

Robert Brier, Darryn E. Bryant: Perpendicular Rectangular Latin Arrays. Graphs and Combinatorics 25(1): 15-25 (2009)

Darryn E. Bryant, Victor Scharaschkin: Complete solutions to the Oberwolfach problem for an infinite set of orders. J. Comb. Theory, Ser. B 99(6): 904-918 (2009)

Peter Adams, Darryn E. Bryant, Melinda Buchanan: Completing Partial Latin Squares with Two Filled Rows and Two Filled Columns. Electr. J. Comb. 15(1) (2008)

Darryn E. Bryant, Daniel Horsley: Packing cycles in complete graphs. J. Comb. Theory, Ser. B 98(5): 1014-1037 (2008)

Peter Adams, Darryn E. Bryant, Mary Waterhouse: Some equitably 2-colourable cycle decompositions. Ars Comb. 85 (2007)

Darryn E. Bryant, Melinda Buchanan: Embedding partial totally symmetric quasigroups. J. Comb. Theory, Ser. A 114(6): 1046-1088 (2007)

Darryn E. Bryant, Saad El-Zanati, Charles Vanden Eynden: Erratum to: "Star factorizations of graph products". Journal of Graph Theory 54(1): 88-89 (2007)

Robert Brier, Darryn E. Bryant: Varieties of algebras arising from K-perfect m-cycle systems. Discrete Mathematics 306(17): 2038-2046 (2006)

Darryn E. Bryant, Barbara M. Maenhaut, Ian M. Wanless: New families of atomic Latin squares and perfect 1-factorisations. J. Comb. Theory, Ser. A 113(4): 608-624 (2006)

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)

Jonathan M. Keith, Peter Adams, Darryn E. Bryant, Duncan A. E. Cochran, Gita H. Lala, Keith R. Mitchelson: Algorithms for sequence analysis via mutagenesis. Bioinformatics 20(15): 2401-2410 (2004)

Peter Adams, Darryn E. Bryant, Barbara M. Maenhaut: Common multiples of complete graphs and a 4-cycle. Discrete Mathematics 275(1-3): 289-297 (2004)

Peter Adams, Darryn E. Bryant, James G. Lefevre, Mary Waterhouse: Some equitably 3-colourable cycle decompositions. Discrete Mathematics 284(1-3): 21-35 (2004)

Darryn E. Bryant, Barbara M. Maenhaut, Kathleen A. S. Quinn, Bridget S. Webb: Existence and embeddings of partial Steiner triple systems of order ten with cubic leaves. Discrete Mathematics 284(1-3): 83-95 (2004)

Darryn E. Bryant, Mike J. Grannell, Terry S. Griggs, Martin Macaj: Configurations in 4-Cycle Systems. Graphs and Combinatorics 20(2): 161-179 (2004)

Darryn E. Bryant: Embeddings of partial Steiner triple systems. J. Comb. Theory, Ser. A 106(1): 77-108 (2004)

Darryn E. Bryant, Heather Gavlas, Alan C. H. Ling: Skolem-type Difference Sets for Cycle Systems. Electr. J. Comb. 10 (2003)

Darryn E. Bryant, Mike J. Grannell, Terry S. Griggs, Barbara M. Maenhaut: On the Volume of 4-Cycle Trades. Graphs and Combinatorics 19(1): 53-63 (2003)

Peter Adams, Darryn E. Bryant, Saad El-Zanati, Heather Gavlas: Factorizations of the Complete Graph into C ₅-Factors and 1-Factors. Graphs and Combinatorics 19(3): 289-296 (2003)

Jonathan M. Keith, Peter Adams, Darryn E. Bryant, Keith R. Mitchelson, Duncan A. E. Cochran, Gita H. Lala: Inferring an Original Sequence from Erroneous Copies : A Bayesian Approach. APBC 2003: 23-28

Jonathan M. Keith, Peter Adams, Darryn E. Bryant, Dirk P. Kroese, Keith R. Mitchelson, Duncan A. E. Cochran, Gita H. Lala: A simulated annealing algorithm for finding consensus sequences. Bioinformatics 18(11): 1494-1499 (2002)

Tran Trung Tran, Darryn E. Bryant, Mark L. Smythe: A Subset-orientated Algorithm for Minimizing the Number of Steps Required for Synthesis of Cyclic-peptide Libraries. Computers & Chemistry 26(2): 113-117 (2002)

Peter Adams, Elizabeth J. Billington, Darryn E. Bryant, Ebadollah S. Mahmoodian: The three-way intersection problem for latin squares. Discrete Mathematics 243(1-3): 1-19 (2002)

Darryn E. Bryant, Saad El-Zanati, Charles Vanden Eynden: Factorizations of and by powers of complete graphs. Discrete Mathematics 243(1-3): 201-205 (2002)

Darryn E. Bryant, Hung-Lin Fu: C₄-saturated bipartite graphs. Discrete Mathematics 259(1-3): 263-268 (2002)

Peter Adams, Elizabeth J. Billington, Darryn E. Bryant, Saad El-Zanati: On the Hamilton-Waterloo Problem. Graphs and Combinatorics 18(1): 31-51 (2002)

Darryn E. Bryant, Barbara M. Maenhaut, Ian M. Wanless: A Family of Perfect Factorisations of Complete Bipartite Graphs. J. Comb. Theory, Ser. A 98(2): 328-342 (2002)

Peter Adams, Elizabeth J. Billington, Darryn E. Bryant, Abdollah Khodkar: The mu-way intersection problem for m-cycle systems. Discrete Mathematics 231(1-3): 27-56 (2001)

Darryn E. Bryant, Saad El-Zanati, Charles Vanden Eynden, Dean G. Hoffman: Star Decompositions of Cubes. Graphs and Combinatorics 17(1): 55-59 (2001)

Darryn E. Bryant: On the Oberwolfach Problem with Two Similar Length Cycles. Graphs and Combinatorics 17(2): 199-206 (2001)

Darryn E. Bryant, Saad El-Zanati, Charles Vanden Eynden: Star factorizations of graph products. Journal of Graph Theory 36(2): 59-66 (2001)

Darryn E. Bryant, Abdollah Khodkar: Maximum packings of Kv - Ku with triples. Ars Comb. 55 (2000)

Peter Adams, Darryn E. Bryant, Abdollah Khodkar: The fine structure of balanced ternary designs with block size three, index three and rho2 = 1, 2. Ars Comb. 56 (2000)

Peter Adams, Darryn E. Bryant, Abdollah Khodkar: The fine structure of (v, 3) directed triple systems: v = 2 (mod 3). Ars Comb. 57 (2000)

Peter Adams, Darryn E. Bryant, Abdollah Khodkar: On Alspach's conjecture with two even cycle lengths. Discrete Mathematics 223(1-3): 1-12 (2000)

Darryn E. Bryant, Saad El-Zanati, Christopher A. Rodger: Maximal sets of Hamilton cycles in K_{n, n}. Journal of Graph Theory 33(1): 25-31 (2000)

Elizabeth J. Billington, Darryn E. Bryant: The possible number of cycles in cycle systems. Ars Comb. 52 (1999)

Darryn E. Bryant, Abdollah Khodkar: On Orthogonal Double Covers of Graphs. Des. Codes Cryptography 13(2): 103-105 (1998)

Darryn E. Bryant, Sheila Oates-Williams: Strongly 2-perfect cycle systems and their quasigroups. Discrete Mathematics 167-168: 167-174 (1997)

Darryn E. Bryant, Christopher A. Rodger, Erin R. Spicer: Embeddings of m-cycle systems and incomplete m-cycle systems: m <= 14. Discrete Mathematics 171(1-3): 55-75 (1997)

Peter Adams, Darryn E. Bryant, Saad El-Zanati, Charles Vanden Eynden: d-Cube decompositions ofK_n/K_m. Graphs and Combinatorics 13(1): 1-7 (1997)

Darryn E. Bryant, Dean G. Hoffman, Christopher A. Rodger: 5-Cycle Systems with Holes. Des. Codes Cryptography 8(1-2): 103-108 (1996)

Peter Adams, Elizabeth J. Billington, Darryn E. Bryant: Partitionable perfect cycle systems with cycle lengths 6 and 8. Discrete Mathematics 149(1-3): 1-9 (1996)

Darryn E. Bryant: A special class of nested Steiner triple systems. Discrete Mathematics 152(1-3): 315-320 (1996)

Peter Adams, Darryn E. Bryant: The spectrum problem for the Petersen graph. Journal of Graph Theory 22(2): 175-180 (1996)

Darryn E. Bryant, Sheila Oates-Williams: Mendelsohn designs associated with a class of idempotent quasigroups. Discrete Mathematics 138(1-3): 161-167 (1995)

Darryn E. Bryant, Peter Adams: Decomposing the complete graph into cycles of many lengths. Graphs and Combinatorics 11(2): 97-102 (1995)

Darryn E. Bryant, Christopher A. Rodger: The Doyen-Wilson Theorem Extended to 5-Cycles. J. Comb. Theory, Ser. A 68(1): 218-225 (1994)

Darryn E. Bryant: Varieties of Quasigroups Arising from 2-Perfect m-Cycle Systems. Des. Codes Cryptography 2(2): 159-168 (1992)