Darryn E. Bryant

According to our database, Darryn E. Bryant authored at least 95 papers between 1992 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

On the Steiner Quadruple System with Ten Points.

Robert Brier, Darryn E. Bryant

Bull. ICA, 2021

2019

Hamilton path decompositions of complete multipartite graphs.

Darryn E. Bryant, Hao Chuien Hang, Sarada Herke

J. Comb. Theory B, 2019

2018

On Hamilton decompositions of infinite circulant graphs.

Darryn E. Bryant, Sarada Herke, Barbara M. Maenhaut, Bridget S. Webb

J. Graph Theory, 2018

Decompositions of complete multigraphs into cycles of varying lengths.

Darryn E. Bryant, Daniel Horsley, Barbara M. Maenhaut, Benjamin R. Smith

J. Comb. Theory B, 2018

2017

Compressed Sensing With Combinatorial Designs: Theory and Simulations.

Darryn E. Bryant, Charles J. Colbourn, Daniel Horsley, Padraig Ó Catháin

IEEE Trans. Inf. Theory, 2017

Steiner Triple Systems with High Chromatic Index.

Darryn E. Bryant, Charles J. Colbourn, Daniel Horsley, Ian M. Wanless

SIAM J. Discret. Math., 2017

2016

Decompositions of Complete Graphs into Bipartite 2-Regular Subgraphs.

Darryn E. Bryant, Andrea C. Burgess, Peter Danziger

Electron. J. Comb., 2016

On Almost-Regular Edge Colourings of Hypergraphs.

Darryn E. Bryant

Electron. J. Comb., 2016

On factorisations of complete graphs into circulant graphs and the Oberwolfach problem.

Brian Alspach, Darryn E. Bryant, Daniel Horsley, Barbara M. Maenhaut, Victor Scharaschkin

Ars Math. Contemp., 2016

2015

Steiner Triple Systems without Parallel Classes.

Darryn E. Bryant, Daniel Horsley

SIAM J. Discret. Math., 2015

Bipartite 2-Factorizations of Complete Multipartite Graphs.

Darryn E. Bryant, Peter Danziger, William Pettersson

J. Graph Theory, 2015

Decomposing Graphs of High Minimum Degree into 4-Cycles.

Darryn E. Bryant, Nicholas J. Cavenagh

J. Graph Theory, 2015

Vertex-transitive graphs that have no Hamilton decomposition.

Darryn E. Bryant, Matthew Dean

J. Comb. Theory B, 2015

Compressed sensing and designs: theory and simulations.

Darryn E. Bryant, Charles J. Colbourn, Daniel Horsley, Padraig Ó Catháin

CoRR, 2015

2014

Brushing without capacity restrictions.

Darryn E. Bryant, Nevena Francetic, Przemyslaw Gordinowicz, David A. Pike, Pawel Pralat

Discret. Appl. Math., 2014

Decompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphs.

Darryn E. Bryant, Sarada Herke, Barbara M. Maenhaut, Wannasiri Wannasit

Australas. J Comb., 2014

2013

A second infinite family of Steiner triple systems without almost parallel classes.

Darryn E. Bryant, Daniel Horsley

J. Comb. Theory A, 2013

2012

Nonextendible Latin Cuboids.

Darryn E. Bryant, Nicholas J. Cavenagh, Barbara M. Maenhaut, Kyle Pula, Ian M. Wanless

SIAM J. Discret. Math., 2012

Small embeddings for partial triple systems of odd index.

Darryn E. Bryant, Geoffrey Martin

J. Comb. Theory A, 2012

Paley graphs have Hamilton decompositions.

Brian Alspach, Darryn E. Bryant, Danny Dyer

Discret. Math., 2012

2011

On bipartite 2-factorizations of <i>k</i>_<i>n</i> - <i>I</i> and the Oberwolfach problem.

Darryn E. Bryant, Peter Danziger

J. Graph Theory, 2011

On the non-existence of pair covering designs with at least as many points as blocks.

Darryn E. Bryant, Melinda Buchanan, Daniel Horsley, Barbara M. Maenhaut, Victor Scharaschkin

Comb., 2011

On the existence and embedding of edge-coloured graph decompositions.

Robert Brier, Darryn E. Bryant

Ars Comb., 2011

2010

An asymptotic solution to the cycle decomposition problem for complete graphs.

Darryn E. Bryant, Daniel Horsley

J. Comb. Theory A, 2010

Packing paths in complete graphs.

Darryn E. Bryant

J. Comb. Theory B, 2010

Defining scaffold geometries for interacting with proteins: geometrical classification of secondary structure linking regions.

Tran Trung Tran, Christina Kulis, Steven M. Long, Darryn E. Bryant, Peter Adams, Mark L. Smythe

J. Comput. Aided Mol. Des., 2010

2009

Complete solutions to the Oberwolfach problem for an infinite set of orders.

Darryn E. Bryant, Victor Scharaschkin

J. Comb. Theory B, 2009

Perpendicular Rectangular Latin Arrays.

Robert Brier, Darryn E. Bryant

Graphs Comb., 2009

The spectrum for quasigroups with cyclic automorphisms and additional symmetries.

Darryn E. Bryant, Melinda Buchanan, Ian M. Wanless

Discret. Math., 2009

Completing partial commutative quasigroups constructed from partial Steiner triple systems is NP-complete.

Darryn E. Bryant

Discret. Math., 2009

Indivisible plexes in latin squares.

Darryn E. Bryant, Judith Egan, Barbara M. Maenhaut, Ian M. Wanless

Des. Codes Cryptogr., 2009

Some results on decompositions of low degree circulant graphs.

Darryn E. Bryant, Geoffrey Martin

Australas. J Comb., 2009

2008

Packing cycles in complete graphs.

Darryn E. Bryant, Daniel Horsley

J. Comb. Theory B, 2008

Completing Partial Latin Squares with Two Filled Rows and Two Filled Columns.

Peter Adams, Darryn E. Bryant, Melinda Buchanan

Electron. J. Comb., 2008

2007

Erratum to: "Star factorizations of graph products".

Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden

J. Graph Theory, 2007

Embedding partial totally symmetric quasigroups.

Darryn E. Bryant, Melinda Buchanan

J. Comb. Theory A, 2007

Some equitably 2-colourable cycle decompositions.

Peter Adams, Darryn E. Bryant, Mary Waterhouse

Ars Comb., 2007

2006

New families of atomic Latin squares and perfect 1-factorisations.

Darryn E. Bryant, Barbara M. Maenhaut, Ian M. Wanless

J. Comb. Theory A, 2006

Varieties of algebras arising from K-perfect m-cycle systems.

Robert Brier, Darryn E. Bryant

Discret. Math., 2006

Diagonally switchable 4-cycle systems.

Peter Adams, Darryn E. Bryant, Mike J. Grannell, Terry S. Griggs

Australas. J Comb., 2006

Two-factorisations of complete graphs of orders fifteen and seventeen.

Peter Adams, Darryn E. Bryant

Australas. J Comb., 2006

2005

Decompositions into 2-regular subgraph and equitable partial cycle decompositions.

Darryn E. Bryant, Daniel Horsley, Barbara M. Maenhaut

J. Comb. Theory B, 2005

Hamilton decompositions of complete bipartite graphs with a 3-factor leave.

Darryn E. Bryant, C. David Leach, Christopher A. Rodger

Australas. J Comb., 2005

2004

Embeddings of partial Steiner triple systems.

Darryn E. Bryant

J. Comb. Theory A, 2004

Configurations in 4-Cycle Systems.

Darryn E. Bryant, Mike J. Grannell, Terry S. Griggs, Martin Macaj

Graphs Comb., 2004

Existence and embeddings of partial Steiner triple systems of order ten with cubic leaves.

Darryn E. Bryant, Barbara M. Maenhaut, Kathleen A. S. Quinn, Bridget S. Webb

Discret. Math., 2004

Common multiples of complete graphs and a 4-cycle.

Peter Adams, Darryn E. Bryant, Barbara M. Maenhaut

Discret. Math., 2004

Some equitably 3-colourable cycle decompositions.

Peter Adams, Darryn E. Bryant, James G. Lefevre, Mary Waterhouse

Discret. Math., 2004

Algorithms for sequence analysis via mutagenesis.

Jonathan M. Keith, Peter Adams, Darryn E. Bryant, Duncan A. E. Cochran, Gita H. Lala, Keith R. Mitchelson

Bioinform., 2004

2003

On the Volume of 4-Cycle Trades.

Darryn E. Bryant, Mike J. Grannell, Terry S. Griggs, Barbara M. Maenhaut

Graphs Comb., 2003

Factorizations of the Complete Graph into <i>C</i> ₅-Factors and 1-Factors.

Peter Adams, Darryn E. Bryant, Saad I. El-Zanati, Heather Gavlas

Graphs Comb., 2003

Skolem-type Difference Sets for Cycle Systems.

Darryn E. Bryant, Heather Gavlas, Alan C. H. Ling

Electron. J. Comb., 2003

Inferring an Original Sequence from Erroneous Copies : A Bayesian Approach.

Jonathan M. Keith, Peter Adams, Darryn E. Bryant, Keith R. Mitchelson, Duncan A. E. Cochran, Gita H. Lala

Proceedings of the First Asia-Pacific Bioinformatics Conference (APBC 2003), 2003

2002

A Family of Perfect Factorisations of Complete Bipartite Graphs.

Darryn E. Bryant, Barbara M. Maenhaut, Ian M. Wanless

J. Comb. Theory A, 2002

On the Hamilton-Waterloo Problem.

Peter Adams, Elizabeth J. Billington, Darryn E. Bryant, Saad I. El-Zanati

Graphs Comb., 2002

<i>C</i>₄-saturated bipartite graphs.

Darryn E. Bryant, Hung-Lin Fu

Discret. Math., 2002

Factorizations of and by powers of complete graphs.

Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden

Discret. Math., 2002

The three-way intersection problem for latin squares.

Peter Adams, Elizabeth J. Billington, Darryn E. Bryant, Ebadollah S. Mahmoodian

Discret. Math., 2002

A Subset-orientated Algorithm for Minimizing the Number of Steps Required for Synthesis of Cyclic-peptide Libraries.

Tran Trung Tran, Darryn E. Bryant, Mark L. Smythe

Comput. Chem., 2002

A simulated annealing algorithm for finding consensus sequences.

Jonathan M. Keith, Peter Adams, Darryn E. Bryant, Dirk P. Kroese, Keith R. Mitchelson, Duncan A. E. Cochran, Gita H. Lala

Bioinform., 2002

2001

Star factorizations of graph products.

Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden

J. Graph Theory, 2001

Star Decompositions of Cubes.

Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden, Dean G. Hoffman

Graphs Comb., 2001

On the Oberwolfach Problem with Two Similar Length Cycles.

Darryn E. Bryant

Graphs Comb., 2001

The mu-way intersection problem for m-cycle systems.

Peter Adams, Elizabeth J. Billington, Darryn E. Bryant, Abdollah Khodkar

Discret. Math., 2001

The μ-way intersection problem for cubes.

Peter Adams, Darryn E. Bryant

Australas. J Comb., 2001

2000

Maximal sets of Hamilton cycles in <i>K_{n, n}</i>.

Darryn E. Bryant, Saad I. El-Zanati, Christopher A. Rodger

J. Graph Theory, 2000

On Alspach's conjecture with two even cycle lengths.

Peter Adams, Darryn E. Bryant, Abdollah Khodkar

Discret. Math., 2000

Maximum packings of Kv - Ku with triples.

Darryn E. Bryant, Abdollah Khodkar

Ars Comb., 2000

The fine structure of (v, 3) directed triple systems: v = 2 (mod 3).

Peter Adams, Darryn E. Bryant, Abdollah Khodkar

Ars Comb., 2000

The fine structure of balanced ternary designs with block size three, index three and rho2 = 1, 2.

Peter Adams, Darryn E. Bryant, Abdollah Khodkar

Ars Comb., 2000

1999

The possible number of cycles in cycle systems.

Elizabeth J. Billington, Darryn E. Bryant

Ars Comb., 1999

Strongly 2-perfect trail systems and related quasigroups.

Darryn E. Bryant, Sheila Oates-Williams

Australas. J Comb., 1999

Packing and covering the complete graph with cubes.

Peter Adams, Darryn E. Bryant, Saad I. El-Zanati

Australas. J Comb., 1999

1998

On Orthogonal Double Covers of Graphs.

Darryn E. Bryant, Abdollah Khodkar

Des. Codes Cryptogr., 1998

Defining sets of G-designs.

Darryn E. Bryant, Barbara M. Maenhaut

Australas. J Comb., 1998

1997

2m-Cycle Systems of K 2m+1\C m.

Darryn E. Bryant

Graphs Comb., 1997

<i>d</i>-Cube decompositions of<i>K</i>_n/<i>K</i>_m.

Peter Adams, Darryn E. Bryant, Saad I. El-Zanati, Charles Vanden Eynden

Graphs Comb., 1997

Embeddings of m-cycle systems and incomplete m-cycle systems: m <= 14.

Darryn E. Bryant, Christopher A. Rodger, Erin R. Spicer

Discret. Math., 1997

Strongly 2-perfect cycle systems and their quasigroups.

Darryn E. Bryant, Sheila Oates-Williams

Discret. Math., 1997

On the volume of trades in triple systems.

Darryn E. Bryant

Australas. J Comb., 1997

Factorizations of complete multigraphs.

B. J. Battersby, Darryn E. Bryant, Christopher A. Rodger

Australas. J Comb., 1997

The intersection problem for cubes.

Peter Adams, Darryn E. Bryant, Abdollah Khodkar, Saad I. El-Zanati

Australas. J Comb., 1997

1996

The spectrum problem for the Petersen graph.

Peter Adams, Darryn E. Bryant

J. Graph Theory, 1996

A special class of nested Steiner triple systems.

Darryn E. Bryant

Discret. Math., 1996

Partitionable perfect cycle systems with cycle lengths 6 and 8.

Peter Adams, Elizabeth J. Billington, Darryn E. Bryant

Discret. Math., 1996

5-Cycle Systems with Holes.

Darryn E. Bryant, Dean G. Hoffman, Christopher A. Rodger

Des. Codes Cryptogr., 1996

1995

Decomposing the complete graph into cycles of many lengths.

Darryn E. Bryant, Peter Adams

Graphs Comb., 1995

Mendelsohn designs associated with a class of idempotent quasigroups.

Darryn E. Bryant, Sheila Oates-Williams

Discret. Math., 1995

Lambda-fold cube decompositions.

Peter Adams, Darryn E. Bryant, Saad I. El-Zanati

Australas. J Comb., 1995

1994

The Doyen-Wilson Theorem Extended to 5-Cycles.

Darryn E. Bryant, Christopher A. Rodger

J. Comb. Theory A, 1994

Decompositions of K_{m, n} and K_n into cubes.

Darryn E. Bryant, Saad I. El-Zanati, Robert B. Gardner

Australas. J Comb., 1994

1993

Half-regular symmetric designs.

Alan Rahilly, Cheryl E. Praeger, Anne Penfold Street, Darryn E. Bryant

Australas. J Comb., 1993

2-perfect closed m-trail systems of the complete directed graph with loops.

Darryn E. Bryant, Peter Adams

Australas. J Comb., 1993

1992

Varieties of Quasigroups Arising from 2-Perfect m-Cycle Systems.

Darryn E. Bryant

Des. Codes Cryptogr., 1992

Varieties of P-quasigroups.

Darryn E. Bryant

Australas. J Comb., 1992