Darryn E. Bryant

Orcid: 0000-0002-1605-5343

Affiliations:
  • University of Queensland, Brisbane, Australia


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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
On the Steiner Quadruple System with Ten Points.
Bull. ICA, 2021

2019
Hamilton path decompositions of complete multipartite graphs.
J. Comb. Theory, Ser. B, 2019

2018
On Hamilton decompositions of infinite circulant graphs.
J. Graph Theory, 2018

Decompositions of complete multigraphs into cycles of varying lengths.
J. Comb. Theory, Ser. B, 2018

2017
Compressed Sensing With Combinatorial Designs: Theory and Simulations.
IEEE Trans. Inf. Theory, 2017

Steiner Triple Systems with High Chromatic Index.
SIAM J. Discret. Math., 2017

2016
Decompositions of Complete Graphs into Bipartite 2-Regular Subgraphs.
Electron. J. Comb., 2016

On Almost-Regular Edge Colourings of Hypergraphs.
Electron. J. Comb., 2016

On factorisations of complete graphs into circulant graphs and the Oberwolfach problem.
Ars Math. Contemp., 2016

2015
Steiner Triple Systems without Parallel Classes.
SIAM J. Discret. Math., 2015

Bipartite 2-Factorizations of Complete Multipartite Graphs.
J. Graph Theory, 2015

Decomposing Graphs of High Minimum Degree into 4-Cycles.
J. Graph Theory, 2015

Vertex-transitive graphs that have no Hamilton decomposition.
J. Comb. Theory, Ser. B, 2015

Compressed sensing and designs: theory and simulations.
CoRR, 2015

2014
Brushing without capacity restrictions.
Discret. Appl. Math., 2014

Decompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphs.
Australas. J Comb., 2014

2013
A second infinite family of Steiner triple systems without almost parallel classes.
J. Comb. Theory, Ser. A, 2013

2012
Nonextendible Latin Cuboids.
SIAM J. Discret. Math., 2012

Small embeddings for partial triple systems of odd index.
J. Comb. Theory, Ser. A, 2012

Paley graphs have Hamilton decompositions.
Discret. Math., 2012

2011
On bipartite 2-factorizations of <i>k</i><sub><i>n</i></sub> - <i>I</i> and the Oberwolfach problem.
J. Graph Theory, 2011

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

On the existence and embedding of edge-coloured graph decompositions.
Ars Comb., 2011

2010
An asymptotic solution to the cycle decomposition problem for complete graphs.
J. Comb. Theory, Ser. A, 2010

Packing paths in complete graphs.
J. Comb. Theory, Ser. B, 2010

Defining scaffold geometries for interacting with proteins: geometrical classification of secondary structure linking regions.
J. Comput. Aided Mol. Des., 2010

2009
Complete solutions to the Oberwolfach problem for an infinite set of orders.
J. Comb. Theory, Ser. B, 2009

Perpendicular Rectangular Latin Arrays.
Graphs Comb., 2009

The spectrum for quasigroups with cyclic automorphisms and additional symmetries.
Discret. Math., 2009

Completing partial commutative quasigroups constructed from partial Steiner triple systems is NP-complete.
Discret. Math., 2009

Indivisible plexes in latin squares.
Des. Codes Cryptogr., 2009

Some results on decompositions of low degree circulant graphs.
Australas. J Comb., 2009

2008
Packing cycles in complete graphs.
J. Comb. Theory, Ser. B, 2008

Completing Partial Latin Squares with Two Filled Rows and Two Filled Columns.
Electron. J. Comb., 2008

2007
Erratum to: "Star factorizations of graph products".
J. Graph Theory, 2007

Embedding partial totally symmetric quasigroups.
J. Comb. Theory, Ser. A, 2007

Some equitably 2-colourable cycle decompositions.
Ars Comb., 2007

2006
New families of atomic Latin squares and perfect 1-factorisations.
J. Comb. Theory, Ser. A, 2006

Varieties of algebras arising from K-perfect m-cycle systems.
Discret. Math., 2006

Diagonally switchable 4-cycle systems.
Australas. J Comb., 2006

Two-factorisations of complete graphs of orders fifteen and seventeen.
Australas. J Comb., 2006

2005
Decompositions into 2-regular subgraph and equitable partial cycle decompositions.
J. Comb. Theory, Ser. B, 2005

Hamilton decompositions of complete bipartite graphs with a 3-factor leave.
Australas. J Comb., 2005

2004
Embeddings of partial Steiner triple systems.
J. Comb. Theory, Ser. A, 2004

Configurations in 4-Cycle Systems.
Graphs Comb., 2004

Existence and embeddings of partial Steiner triple systems of order ten with cubic leaves.
Discret. Math., 2004

Common multiples of complete graphs and a 4-cycle.
Discret. Math., 2004

Some equitably 3-colourable cycle decompositions.
Discret. Math., 2004

Algorithms for sequence analysis via mutagenesis.
Bioinform., 2004

2003
On the Volume of 4-Cycle Trades.
Graphs Comb., 2003

Factorizations of the Complete Graph into <i>C</i> <sub>5</sub>-Factors and 1-Factors.
Graphs Comb., 2003

Skolem-type Difference Sets for Cycle Systems.
Electron. J. Comb., 2003

Inferring an Original Sequence from Erroneous Copies : A Bayesian Approach.
Proceedings of the First Asia-Pacific Bioinformatics Conference (APBC 2003), 2003

2002
A Family of Perfect Factorisations of Complete Bipartite Graphs.
J. Comb. Theory, Ser. A, 2002

On the Hamilton-Waterloo Problem.
Graphs Comb., 2002

<i>C</i><sub>4</sub>-saturated bipartite graphs.
Discret. Math., 2002

Factorizations of and by powers of complete graphs.
Discret. Math., 2002

The three-way intersection problem for latin squares.
Discret. Math., 2002

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

A simulated annealing algorithm for finding consensus sequences.
Bioinform., 2002

2001
Star factorizations of graph products.
J. Graph Theory, 2001

Star Decompositions of Cubes.
Graphs Comb., 2001

On the Oberwolfach Problem with Two Similar Length Cycles.
Graphs Comb., 2001

The mu-way intersection problem for m-cycle systems.
Discret. Math., 2001

The μ-way intersection problem for cubes.
Australas. J Comb., 2001

2000
Maximal sets of Hamilton cycles in <i>K<sub>n, n</sub></i>.
J. Graph Theory, 2000

On Alspach's conjecture with two even cycle lengths.
Discret. Math., 2000

Maximum packings of Kv - Ku with triples.
Ars Comb., 2000

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

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

1999
The possible number of cycles in cycle systems.
Ars Comb., 1999

Strongly 2-perfect trail systems and related quasigroups.
Australas. J Comb., 1999

Packing and covering the complete graph with cubes.
Australas. J Comb., 1999

1998
On Orthogonal Double Covers of Graphs.
Des. Codes Cryptogr., 1998

Defining sets of G-designs.
Australas. J Comb., 1998

1997
2m-Cycle Systems of K 2m+1\C m.
Graphs Comb., 1997

<i>d</i>-Cube decompositions of<i>K</i><sub>n</sub>/<i>K</i><sub>m</sub>.
Graphs Comb., 1997

Embeddings of m-cycle systems and incomplete m-cycle systems: m <= 14.
Discret. Math., 1997

Strongly 2-perfect cycle systems and their quasigroups.
Discret. Math., 1997

On the volume of trades in triple systems.
Australas. J Comb., 1997

Factorizations of complete multigraphs.
Australas. J Comb., 1997

The intersection problem for cubes.
Australas. J Comb., 1997

1996
The spectrum problem for the Petersen graph.
J. Graph Theory, 1996

A special class of nested Steiner triple systems.
Discret. Math., 1996

Partitionable perfect cycle systems with cycle lengths 6 and 8.
Discret. Math., 1996

5-Cycle Systems with Holes.
Des. Codes Cryptogr., 1996

1995
Decomposing the complete graph into cycles of many lengths.
Graphs Comb., 1995

Mendelsohn designs associated with a class of idempotent quasigroups.
Discret. Math., 1995

Lambda-fold cube decompositions.
Australas. J Comb., 1995

1994
The Doyen-Wilson Theorem Extended to 5-Cycles.
J. Comb. Theory, Ser. A, 1994

Decompositions of K<sub>m, n</sub> and K<sub>n</sub> into cubes.
Australas. J Comb., 1994

1993
Half-regular symmetric designs.
Australas. J Comb., 1993

2-perfect closed m-trail systems of the complete directed graph with loops.
Australas. J Comb., 1993

1992
Varieties of Quasigroups Arising from 2-Perfect m-Cycle Systems.
Des. Codes Cryptogr., 1992

Varieties of P-quasigroups.
Australas. J Comb., 1992


  Loading...