Professor

Darryn Bryant

Email: 
Phone: 
+61 7 336 51342

Background

Darryn Bryant's research interests are in combinatorics, specifically in graph theory and design theory.

He received his PhD from The University of Queensland in 1993. His current research projects concern fundamental open problems on graph decompositions and a new design theory-based approach to signal sampling via compressed sensing.

Availability

Professor Darryn Bryant is:
Available for supervision
Media expert

Fields of research

Pure mathematics

Qualifications

  • Bachelor of Science, The University of Queensland
  • Masters (Coursework), The University of Queensland
  • Doctor of Philosophy, The University of Queensland

Research interests

  • Graph theory and design theory

    Various graph decomposition problems including decompositions into Hamilton cycles, embedding problems and perfect factorisations are being investigated. This includes collaborative work with colleagues at The University of Queensland, and in the UK, USA and Canada.

Search Professor Darryn Bryant’s works on UQ eSpace

159 works between 1992 and 2024
All (159) Journal Article (152) Book Chapter (4) Conference Publication (3)

61 - 80 of 159 works

2006

Book Chapter

Sequencing by Aligning Mutated DNA Fragments (SAM)

Cochran, Duncan, Lala, Gita, Keith, Jonathan, Adams, Peter, Bryant, Darryn and Mitchelson, Keith (2006). Sequencing by Aligning Mutated DNA Fragments (SAM). The Frontiers of Biochip Technology. (pp. 231-245) edited by Wan-Li, Xing and Jing, Cheng. New York: Springer Science+Business Media. doi: 10.1007/0-387-25585-0_15

Sequencing by Aligning Mutated DNA Fragments (SAM)

2006

Journal Article

Two-factorisations of complete graphs of orders fifteen and seventeen

Adams, Peter and Bryant, Darryn (2006). Two-factorisations of complete graphs of orders fifteen and seventeen. Australasian Journal of Combinatorics, 35 (1), 113-118.

Two-factorisations of complete graphs of orders fifteen and seventeen

2006

Journal Article

Decomposition of complete graphs into 5-cubes

Bryant, D, El-Zanati, SI, Maenhaut, B and Vanden Eynden, C (2006). Decomposition of complete graphs into 5-cubes. Journal of Combinatorial Designs, 14 (2), 159-166. doi: 10.1002/jcd.20066

Decomposition of complete graphs into 5-cubes

2006

Journal Article

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

Brier, R and Bryant, D (2006). Varieties of algebras arising from K-perfect m-cycle systems. Discrete Mathematics, 306 (17), 2038-2046. doi: 10.1016/j.disc.2006.04.002

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

2005

Journal Article

Sampling phylogenetic tree space with the generalized Gibbs sampler

Keith, J. M., Adams, P., Ragan, M. A. and Bryant, D. E. (2005). Sampling phylogenetic tree space with the generalized Gibbs sampler. Molecular Phylogenetics and Evolution, 34 (3), 459-468. doi: 10.1016/j.ympev.2004.11.016

Sampling phylogenetic tree space with the generalized Gibbs sampler

2005

Journal Article

Decompositions into 2-regular subgraphs and equitable partial cycle decompositions

Bryant, D., Horsley, D. and Maenhaut, B. (2005). Decompositions into 2-regular subgraphs and equitable partial cycle decompositions. Journal of Combinatorial Theory, Series B, 93 (1), 67-72. doi: 10.1016/j.jctb.2004.06.002

Decompositions into 2-regular subgraphs and equitable partial cycle decompositions

2005

Journal Article

Large sets of cycle systems on nine points

Bryant, D. E., Grannell, M. and Griggs, T. (2005). Large sets of cycle systems on nine points. Journal of Combinatorial Mathematics and Combinatorial Computing, 53, 95-102.

Large sets of cycle systems on nine points

2005

Journal Article

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

Bryant, D. E., Leach, C D and Rodger, C A (2005). Hamilton decompositions of complete bipartite graphs with a 3-factor leave. Australasian Journal of Combinatorics, 31, 331-336.

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

2004

Journal Article

A generalized Markov sampler

Keith, Jonathan M., Kroese, Dirk P. and Bryant, Darryn (2004). A generalized Markov sampler. Methodology And Computing In Applied Probability, 6 (1), 29-53. doi: 10.1023/B:MCAP.0000012414.14405.15

A generalized Markov sampler

2004

Journal Article

Unlocking hidden genomic sequence

Keith, Jonathan M., Cochran, Duncan A. E., Lala, Gita H., Adams, Peter, Bryant, Darryn and Mitchelson, Keith R. (2004). Unlocking hidden genomic sequence. Nucleic Acids Research, 32 (3), e35. doi: 10.1093/nar/gnh022

Unlocking hidden genomic sequence

2004

Journal Article

Common multiples of complete graphs and a 4-cycle

Adams, P, Bryant, D and Maenhaut, B (2004). Common multiples of complete graphs and a 4-cycle. Discrete Mathematics, 275 (1-3), 289-297. doi: 10.1016/j.disc.2002.11.001

Common multiples of complete graphs and a 4-cycle

2004

Journal Article

Algorithms for sequence analysis via mutagenesis

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

Algorithms for sequence analysis via mutagenesis

2004

Journal Article

On the completion of Latin rectangles to symmetric Latin squares

Bryant, D. and Rodger, C. A. (2004). On the completion of Latin rectangles to symmetric Latin squares. Journal of The Australian Mathematical Society, 76 (1), 109-124. doi: 10.1017/S1446788700008739

On the completion of Latin rectangles to symmetric Latin squares

2004

Journal Article

Embeddings of partial Steiner triple systems

Bryant, D. E. (2004). Embeddings of partial Steiner triple systems. Journal of Combinatorial Theory Series A, 106 (1), 77-108. doi: 10.1016/j.jcta.2004.01.004

Embeddings of partial Steiner triple systems

2004

Journal Article

Hamilton cycle rich two-factorizations of complete graphs

Bryant, D (2004). Hamilton cycle rich two-factorizations of complete graphs. Journal of Combinatorial Designs, 12 (2), 147-155. doi: 10.1002/jcd.20005

Hamilton cycle rich two-factorizations of complete graphs

2004

Journal Article

Some equitably 3-colourable cycle decompositions

Adams, P, Bryant, D, Lefevre, J and Waterhouse, M (2004). Some equitably 3-colourable cycle decompositions. Discrete Mathematics, 284 (1-3), 21-35. doi: 10.1016/j.disc.2003.11.019

Some equitably 3-colourable cycle decompositions

2004

Journal Article

Cube factorizations of complete graphs

Adams, P, Bryant, D and Maenhaut, B (2004). Cube factorizations of complete graphs. Journal of Combinatorial Designs, 12 (5), 381-388. doi: 10.1002/jcd.20015

Cube factorizations of complete graphs

2004

Journal Article

Decompositions of complete graphs into triangles and Hamilton cycles

Bryant, Darryn and Maenhaut, Barbara (2004). Decompositions of complete graphs into triangles and Hamilton cycles. Journal of Combinatorial Designs, 12 (3), 221-232. doi: 10.1002/jcd.10063

Decompositions of complete graphs into triangles and Hamilton cycles

2004

Journal Article

Configurations in 4-cycle systems

Bryant, D, Grannell, M, Griggs, T and Macaj, M (2004). Configurations in 4-cycle systems. Graphs And Combinatorics, 20 (2), 161-179. doi: 10.1007/s00373-004-0553-4

Configurations in 4-cycle systems

2004

Journal Article

Virtual drug discovery using graph

Adams, P., Bryant, D. E., Long, S., Smythe, M. L. and Tran, T. T. (2004). Virtual drug discovery using graph. Bulletin of the Institute of Combinatorics and its Applications, 40, 100-106.

Virtual drug discovery using graph

Current funding

  • 2024 - 2028
    Fractional decomposition of graphs and the Nash-Williams conjecture (ARC Discovery Project externally administered by Monash University)
    Monash University
    Open grant

Past funding

  • 2015 - 2018
    Decompositions of graphs into cycles
    Vice-Chancellor's Senior Research Fellowship
    Open grant
  • 2015 - 2019
    Matchings in Combinatorial Structures (ARC Discovery Project administered by Monash University)
    Monash University
    Open grant
  • 2015 - 2018
    The Oberwolfach Problem and related Graph Factorisations
    ARC Discovery Projects
    Open grant
  • 2012 - 2016
    A new approach to compressed sensing
    ARC Discovery Projects
    Open grant
  • 2012 - 2015
    Decompositions of graphs into cycles: Alspach's Conjecture and the Oberwolfach Problem.
    ARC Discovery Projects
    Open grant
  • 2012
    ResTeach Funding 2012 0.2 FTE School of Math & Physics
    UQ ResTeach
    Open grant
  • 2007 - 2011
    Cycle decompositions of graphs
    ARC Discovery Projects
    Open grant
  • 2006 - 2010
    Analysis of the Structure of Latin Squares (ARC Discovery project administered by Monash University)
    Monash University
    Open grant
  • 2003
    To Expand Research On The Isolation And Direct To Work On New Combinatorial Graph Decompositions Techniques
    UQ Travel Grants Scheme
    Open grant
  • 2002 - 2003
    Emerging applications of advanced computational methods and discrete mathematics.
    ARC Discovery Projects
    Open grant
  • 2002 - 2006
    Mutagenesis and combinatorial algorithms for sequencing problematic genomic regions.
    ARC Discovery Projects
    Open grant
  • 1999
    Combinatorial graph decomposition techniques and DNA sequencing by hybridisation
    UQ Foundation Research Excellence Awards - DVC(R) Funding
    Open grant
  • 1998
    Embedding Cycle Systems of Multigraphs
    University of Queensland New Staff Research Grant
    Open grant
  • 1998 - 2000
    Rapid DNA sequencing by hybridization of a patterned colloidal array
    ARC Australian Research Council (Large grants)
    Open grant
  • 1997 - 1999
    Statistical laws for computational collapse of chaotic systems
    ARC Australian Research Council (Large grants)
    Open grant
  • 1997 - 1999
    Trades in graphs
    ARC Australian Research Council (Large grants)
    Open grant
  • 1996 - 1998
    Large sets of cycle systems and related designs
    ARC Australian Postdoctoral Research Fellowship
    Open grant
  • 1995 - 1997
    Parallel algorithms and computational techniques in combinatorial design theory
    ARC Australian Research Council (Large grants)
    Open grant

Availability

Professor Darryn Bryant is:
Available for supervision

Before you email them, read our advice on how to contact a supervisor.

Available projects

  • The 2-factorisation problem for complete graphs

    This project examines the existence of 2-factorisations of complete graphs in which the 2-factors are isomorphic to given 2-regular graphs. Using computers the problem has been completely solved for complete graphs of order less than 20 and several infinite families of results are known. However much work remains to be done on this problem and there is plenty of scope for new discoveries to be made by students who enjoy design theory or graph theory.

  • Hamilton cycle decompositions of Cayley graphs and related topics

    There is an unsolved conjecture that every connected 2k-regular Cayley graph on a finite abelian group has a decomposition into k Hamilton cycles. Cayley graphs are graphs based on groups and students who like group theory or graph theory will enjoy working on this and related problems.

Supervision history

Current supervision

  • Doctor Philosophy

    Analytic number theory and applications to graph theory

    Associate Advisor

    Other advisors: Dr Adrian Dudek

  • Doctor Philosophy

    Hypergraphs with high chromatic index

    Associate Advisor

    Other advisors: Dr Sara Davies

Completed supervision

Enquiries

Contact Professor Darryn Bryant directly for media enquiries about:

  • Combinatorics
  • Design theory - mathematics
  • Graph theory - mathematics
  • Maths - combinatorics

Need help?

For help with finding experts, story ideas and media enquiries, contact our Media team:

communications@uq.edu.au