Darryn E. Bryant

Publication Activity (10 Years)

Years Active: 1992-2021
Publications (10 Years): 14

Top Topics

Structured Objects

Graph Theoretic

Top Venues

SIAM J. Discret. Math.

J. Graph Theory

J. Comb. Theory, Ser. B

Electron. J. Comb.

Publications

Robert Brier, Darryn E. Bryant
On the Steiner Quadruple System with Ten Points. Bull. ICA 91 (2021)
Darryn E. Bryant, Hao Chuien Hang, Sarada Herke
Hamilton path decompositions of complete multipartite graphs. J. Comb. Theory, Ser. B 135 (2019)
Darryn E. Bryant, Sarada Herke, Barbara M. Maenhaut, Bridget S. Webb
On Hamilton decompositions of infinite circulant graphs. J. Graph Theory 88 (3) (2018)
Darryn E. Bryant, Daniel Horsley, Barbara M. Maenhaut, Benjamin R. Smith
Decompositions of complete multigraphs into cycles of varying lengths. J. Comb. Theory, Ser. B 129 (2018)
Darryn E. Bryant, Charles J. Colbourn, Daniel Horsley, Padraig Ó Catháin
Compressed Sensing With Combinatorial Designs: Theory and Simulations. IEEE Trans. Inf. Theory 63 (8) (2017)
Darryn E. Bryant, Charles J. Colbourn, Daniel Horsley, Ian M. Wanless
Steiner Triple Systems with High Chromatic Index. SIAM J. Discret. Math. 31 (4) (2017)
Brian Alspach, Darryn E. Bryant, Daniel Horsley, Barbara M. Maenhaut, Victor Scharaschkin
On factorisations of complete graphs into circulant graphs and the Oberwolfach problem. Ars Math. Contemp. 11 (1) (2016)
Darryn E. Bryant
On Almost-Regular Edge Colourings of Hypergraphs. Electron. J. Comb. 23 (4) (2016)
Darryn E. Bryant, Andrea C. Burgess, Peter Danziger
Decompositions of Complete Graphs into Bipartite 2-Regular Subgraphs. Electron. J. Comb. 23 (2) (2016)
Darryn E. Bryant, Charles J. Colbourn, Daniel Horsley, Padraig Ó Catháin
Compressed sensing and designs: theory and simulations. CoRR (2015)
Darryn E. Bryant, Matthew Dean
Vertex-transitive graphs that have no Hamilton decomposition. J. Comb. Theory, Ser. B 114 (2015)
Darryn E. Bryant, Nicholas J. Cavenagh
Decomposing Graphs of High Minimum Degree into 4-Cycles. J. Graph Theory 79 (3) (2015)
Darryn E. Bryant, Peter Danziger, William Pettersson
Bipartite 2-Factorizations of Complete Multipartite Graphs. J. Graph Theory 78 (4) (2015)
Darryn E. Bryant, Daniel Horsley
Steiner Triple Systems without Parallel Classes. SIAM J. Discret. Math. 29 (1) (2015)
Darryn E. Bryant, Sarada Herke, Barbara M. Maenhaut, Wannasiri Wannasit
Decompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphs. Australas. J Comb. 60 (2014)
Darryn E. Bryant, Nevena Francetic, Przemyslaw Gordinowicz, David A. Pike, Pawel Pralat
Brushing without capacity restrictions. Discret. Appl. Math. 170 (2014)
Darryn E. Bryant, Daniel Horsley
A second infinite family of Steiner triple systems without almost parallel classes. J. Comb. Theory, Ser. A 120 (7) (2013)
Darryn E. Bryant, Geoffrey Martin
Small embeddings for partial triple systems of odd index. J. Comb. Theory, Ser. A 119 (2) (2012)
Darryn E. Bryant, Nicholas J. Cavenagh, Barbara M. Maenhaut, Kyle Pula, Ian M. Wanless
Nonextendible Latin Cuboids. SIAM J. Discret. Math. 26 (1) (2012)
Brian Alspach, Darryn E. Bryant, Danny Dyer
Paley graphs have Hamilton decompositions. Discret. Math. 312 (1) (2012)
Darryn E. Bryant, Peter Danziger
and the Oberwolfach problem. J. Graph Theory 68 (1) (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. Comb. 31 (5) (2011)
Robert Brier, Darryn E. Bryant
On the existence and embedding of edge-coloured graph decompositions. Ars Comb. 99 (2011)
Darryn E. Bryant, Daniel Horsley
An asymptotic solution to the cycle decomposition problem for complete graphs. J. Comb. Theory, Ser. A 117 (8) (2010)
Darryn E. Bryant
Packing paths in complete graphs. J. Comb. Theory, Ser. B 100 (2) (2010)
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. J. Comput. Aided Mol. Des. 24 (11) (2010)
Darryn E. Bryant, Melinda Buchanan, Ian M. Wanless
The spectrum for quasigroups with cyclic automorphisms and additional symmetries. Discret. Math. 309 (4) (2009)
Darryn E. Bryant, Judith Egan, Barbara M. Maenhaut, Ian M. Wanless
Indivisible plexes in latin squares. Des. Codes Cryptogr. 52 (1) (2009)
Darryn E. Bryant, Geoffrey Martin
Some results on decompositions of low degree circulant graphs. Australas. J Comb. 45 (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) (2009)
Darryn E. Bryant
Completing partial commutative quasigroups constructed from partial Steiner triple systems is NP-complete. Discret. Math. 309 (14) (2009)
Robert Brier, Darryn E. Bryant
Perpendicular Rectangular Latin Arrays. Graphs Comb. 25 (1) (2009)
Darryn E. Bryant, Daniel Horsley
Packing cycles in complete graphs. J. Comb. Theory, Ser. B 98 (5) (2008)
Peter Adams, Darryn E. Bryant, Melinda Buchanan
Completing Partial Latin Squares with Two Filled Rows and Two Filled Columns. Electron. J. Comb. 15 (1) (2008)
Peter Adams, Darryn E. Bryant, Mary Waterhouse
Some equitably 2-colourable cycle decompositions. Ars Comb. 85 (2007)
Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden
Erratum to: "Star factorizations of graph products". J. Graph Theory 54 (1) (2007)
Darryn E. Bryant, Melinda Buchanan
Embedding partial totally symmetric quasigroups. J. Comb. Theory, Ser. A 114 (6) (2007)
Robert Brier, Darryn E. Bryant
Varieties of algebras arising from K-perfect m-cycle systems. Discret. Math. 306 (17) (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) (2006)
Peter Adams, Darryn E. Bryant, Mike J. Grannell, Terry S. Griggs
Diagonally switchable 4-cycle systems. Australas. J Comb. 34 (2006)
Peter Adams, Darryn E. Bryant
Two-factorisations of complete graphs of orders fifteen and seventeen. Australas. J Comb. 35 (2006)
Darryn E. Bryant, C. David Leach, Christopher A. Rodger
Hamilton decompositions of complete bipartite graphs with a 3-factor leave. Australas. J Comb. 31 (2005)
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) (2005)
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. Discret. Math. 284 (1-3) (2004)
Darryn E. Bryant
Embeddings of partial Steiner triple systems. J. Comb. Theory, Ser. A 106 (1) (2004)
Darryn E. Bryant, Mike J. Grannell, Terry S. Griggs, Martin Macaj
Configurations in 4-Cycle Systems. Graphs Comb. 20 (2) (2004)
Peter Adams, Darryn E. Bryant, Barbara M. Maenhaut
Common multiples of complete graphs and a 4-cycle. Discret. Math. 275 (1-3) (2004)
Jonathan M. Keith, Peter Adams, Darryn E. Bryant, Duncan A. E. Cochran, Gita H. Lala, Keith R. Mitchelson
Algorithms for sequence analysis via mutagenesis. Bioinform. 20 (15) (2004)
Peter Adams, Darryn E. Bryant, James G. Lefevre, Mary Waterhouse
Some equitably 3-colourable cycle decompositions. Discret. Math. 284 (1-3) (2004)
Darryn E. Bryant, Mike J. Grannell, Terry S. Griggs, Barbara M. Maenhaut
On the Volume of 4-Cycle Trades. Graphs Comb. 19 (1) (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)
Darryn E. Bryant, Heather Gavlas, Alan C. H. Ling
Skolem-type Difference Sets for Cycle Systems. Electron. J. Comb. 10 (2003)
Peter Adams, Darryn E. Bryant, Saad I. El-Zanati, Heather Gavlas
-Factors and 1-Factors. Graphs Comb. 19 (3) (2003)
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. Comput. Chem. 26 (2) (2002)
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. Bioinform. 18 (11) (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) (2002)
Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden
Factorizations of and by powers of complete graphs. Discret. Math. 243 (1-3) (2002)
Peter Adams, Elizabeth J. Billington, Darryn E. Bryant, Ebadollah S. Mahmoodian
The three-way intersection problem for latin squares. Discret. Math. 243 (1-3) (2002)
Darryn E. Bryant, Hung-Lin Fu
-saturated bipartite graphs. Discret. Math. 259 (1-3) (2002)
Peter Adams, Elizabeth J. Billington, Darryn E. Bryant, Saad I. El-Zanati
On the Hamilton-Waterloo Problem. Graphs Comb. 18 (1) (2002)
Peter Adams, Elizabeth J. Billington, Darryn E. Bryant, Abdollah Khodkar
The mu-way intersection problem for m-cycle systems. Discret. Math. 231 (1-3) (2001)
Peter Adams, Darryn E. Bryant
The μ-way intersection problem for cubes. Australas. J Comb. 23 (2001)
Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden
Star factorizations of graph products. J. Graph Theory 36 (2) (2001)
Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden, Dean G. Hoffman
Star Decompositions of Cubes. Graphs Comb. 17 (1) (2001)
Darryn E. Bryant
On the Oberwolfach Problem with Two Similar Length Cycles. Graphs Comb. 17 (2) (2001)
Peter Adams, Darryn E. Bryant, Abdollah Khodkar
On Alspach's conjecture with two even cycle lengths. Discret. Math. 223 (1-3) (2000)
Darryn E. Bryant, Abdollah Khodkar
Maximum packings of Kv - Ku with triples. Ars Comb. 55 (2000)
Darryn E. Bryant, Saad I. El-Zanati, Christopher A. Rodger
. J. Graph Theory 33 (1) (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
The fine structure of balanced ternary designs with block size three, index three and rho2 = 1, 2. Ars Comb. 56 (2000)
Elizabeth J. Billington, Darryn E. Bryant
The possible number of cycles in cycle systems. Ars Comb. 52 (1999)
Darryn E. Bryant, Sheila Oates-Williams
Strongly 2-perfect trail systems and related quasigroups. Australas. J Comb. 20 (1999)
Peter Adams, Darryn E. Bryant, Saad I. El-Zanati
Packing and covering the complete graph with cubes. Australas. J Comb. 20 (1999)
Darryn E. Bryant, Barbara M. Maenhaut
Defining sets of G-designs. Australas. J Comb. 17 (1998)
Darryn E. Bryant, Abdollah Khodkar
On Orthogonal Double Covers of Graphs. Des. Codes Cryptogr. 13 (2) (1998)
Peter Adams, Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden
. Graphs Comb. 13 (1) (1997)
Darryn E. Bryant
On the volume of trades in triple systems. Australas. J Comb. 15 (1997)
Darryn E. Bryant, Christopher A. Rodger, Erin R. Spicer
Embeddings of m-cycle systems and incomplete m-cycle systems: m <= 14. Discret. Math. 171 (1-3) (1997)
Darryn E. Bryant
2m-Cycle Systems of K 2m+1\C m. Graphs Comb. 13 (3) (1997)
B. J. Battersby, Darryn E. Bryant, Christopher A. Rodger
Factorizations of complete multigraphs. Australas. J Comb. 16 (1997)
Darryn E. Bryant, Sheila Oates-Williams
Strongly 2-perfect cycle systems and their quasigroups. Discret. Math. (1997)
Peter Adams, Darryn E. Bryant, Abdollah Khodkar, Saad I. El-Zanati
The intersection problem for cubes. Australas. J Comb. 15 (1997)
Darryn E. Bryant
A special class of nested Steiner triple systems. Discret. Math. 152 (1-3) (1996)
Darryn E. Bryant, Dean G. Hoffman, Christopher A. Rodger
5-Cycle Systems with Holes. Des. Codes Cryptogr. 8 (1-2) (1996)
Peter Adams, Darryn E. Bryant
The spectrum problem for the Petersen graph. J. Graph Theory 22 (2) (1996)
Peter Adams, Elizabeth J. Billington, Darryn E. Bryant
Partitionable perfect cycle systems with cycle lengths 6 and 8. Discret. Math. 149 (1-3) (1996)
Darryn E. Bryant, Peter Adams
Decomposing the complete graph into cycles of many lengths. Graphs Comb. 11 (2) (1995)
Darryn E. Bryant, Sheila Oates-Williams
Mendelsohn designs associated with a class of idempotent quasigroups. Discret. Math. 138 (1-3) (1995)
Peter Adams, Darryn E. Bryant, Saad I. El-Zanati
Lambda-fold cube decompositions. Australas. J Comb. 11 (1995)
Darryn E. Bryant, Christopher A. Rodger
The Doyen-Wilson Theorem Extended to 5-Cycles. J. Comb. Theory, Ser. A 68 (1) (1994)
Darryn E. Bryant, Saad I. El-Zanati, Robert B. Gardner
into cubes. Australas. J Comb. 9 (1994)
Darryn E. Bryant, Peter Adams
2-perfect closed m-trail systems of the complete directed graph with loops. Australas. J Comb. 8 (1993)
Alan Rahilly, Cheryl E. Praeger, Anne Penfold Street, Darryn E. Bryant
Half-regular symmetric designs. Australas. J Comb. 8 (1993)
Darryn E. Bryant
Varieties of Quasigroups Arising from 2-Perfect m-Cycle Systems. Des. Codes Cryptogr. 2 (2) (1992)
Darryn E. Bryant
Varieties of P-quasigroups. Australas. J Comb. 6 (1992)