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)

101 - 120 of 159 works

2002

Journal Article

C4-saturated bipartite graphs

Bryant, DE and Fu, HL (2002). C4-saturated bipartite graphs. Discrete Mathematics, 259 (1-3), 263-268. doi: 10.1016/S0012-365X(02)00371-0

C4-saturated bipartite graphs

2002

Journal Article

The three-way intersection problem for latin squares

Adams, P., Billington, E. J., Bryant, D. E. and Mahmoodian, E. S. (2002). The three-way intersection problem for latin squares. Discrete Mathematics, 243 (1-3), 1-19. doi: 10.1016/S0012-365X(00)00454-4

The three-way intersection problem for latin squares

2002

Journal Article

Decompositions of the complete graph into small 2-regular graphs

Adams, P., Bryant, D. E. and Gavlas, H. (2002). Decompositions of the complete graph into small 2-regular graphs. Journal of Combinatorial Mathematics and Combinatorial Computing, 43, 135-146.

Decompositions of the complete graph into small 2-regular graphs

2001

Journal Article

Star decompositions of cubes

Bryant, Darryn E., El-Zanati, Saad, Vanden Eynden, Charles and Hoffman, Dean G. (2001). Star decompositions of cubes. Graphs Combin, 17 (1), 55-59. doi: 10.1007/s003730170054

Star decompositions of cubes

2001

Journal Article

On the Oberwolfach problem with two similar length cycles

Bryant, DE (2001). On the Oberwolfach problem with two similar length cycles. Graphs And Combinatorics, 17 (2), 199-206. doi: 10.1007/s003730170033

On the Oberwolfach problem with two similar length cycles

2001

Journal Article

The mu-way intersection problem for m-cycle systems

Adams, P, Billington, EJ, Bryant, DE and Khodkar, A (2001). The mu-way intersection problem for m-cycle systems. Discrete Mathematics, 231 (1-3), 27-56. doi: 10.1016/S0012-365X(00)00303-4

The mu-way intersection problem for m-cycle systems

2001

Journal Article

On the intersection problem for 1-factorizations and near 1-factorizations of K-v

Bryant, DE and Khodkar, A (2001). On the intersection problem for 1-factorizations and near 1-factorizations of K-v. Utilitas Mathematica, 60, 209-218.

On the intersection problem for 1-factorizations and near 1-factorizations of K-v

2001

Conference Publication

Colloidal barcoding in combinatorial chemistry

Battersby, B. J., Bryant, D. E., Meutermans, W. and Smythe, M. L. (2001). Colloidal barcoding in combinatorial chemistry. Innovation & Perspectives in Solid Phase Synthesis & Combinatl, York, England, 31 Aug - 4 Sept, 1999. UK: Mayflower.

Colloidal barcoding in combinatorial chemistry

2001

Journal Article

5-cycle system of l (K v-K w)

Bryant, D. E. (2001). 5-cycle system of l (K v-K w). Journal of Combinatorial Mathematics and Combinatorial Computing, 38, 161-175.

5-cycle system of l (K v-K w)

2001

Journal Article

The m-way intersection problem for cubes

Adams, P. and Bryant, D. E. (2001). The m-way intersection problem for cubes. Australas. J. Combin., 23, 87-100.

The m-way intersection problem for cubes

2001

Journal Article

Star factorizations of graph products

Bryant, DE, El-Zanati, SI and Vanden Eynden, C (2001). Star factorizations of graph products. Journal of Graph Theory, 36 (2), 59-66. doi: 10.1002/1097-0118(200102)36:23.0.CO;2-A

Star factorizations of graph products

2001

Journal Article

Applications of graph theory in DNA sequencing by hybridization

Adams, P., Bryant, D. E. and Byrnes, S. (2001). Applications of graph theory in DNA sequencing by hybridization. Bulletin of the Institute of Combinatorics and its Applications, 31, 13-20.

Applications of graph theory in DNA sequencing by hybridization

2000

Journal Article

Encoding combinatorial libraries: A novel application of fluorescent silica colloids

Grondahl, Lisbeth, Battersby, Bronwyn J., Bryant, Darryn and Trau, Matt (2000). Encoding combinatorial libraries: A novel application of fluorescent silica colloids. Langmuir, 16 (25), 9709-9715. doi: 10.1021/la000995z

Encoding combinatorial libraries: A novel application of fluorescent silica colloids

2000

Journal Article

The line structure of balanced ternary designs with block size three, index three and rho(2) = 1, 2

Adams, P., Bryant, D. E. and Khodkar, A. (2000). The line structure of balanced ternary designs with block size three, index three and rho(2) = 1, 2. Ars Combinatoria, LVI, 299-308.

The line structure of balanced ternary designs with block size three, index three and rho(2) = 1, 2

2000

Journal Article

Maximum packings of K-v-K-u with triples

Bryant, D. E. and Khodkar, A. (2000). Maximum packings of K-v-K-u with triples. Ars Combinatoria, 55, 259-270.

Maximum packings of K-v-K-u with triples

2000

Journal Article

Toward larger chemical libraries: Encoding with fluorescent colloids in combinatorial chemistry

Battersby, Bronwyn J., Bryant, Darryn, Meutermans, Wim, Matthews, Daniel, Smythe, Mark L. and Trau, Matt (2000). Toward larger chemical libraries: Encoding with fluorescent colloids in combinatorial chemistry. Journal of the American Chemical Society, 122 (9), 2138-2139. doi: 10.1021/ja993634i

Toward larger chemical libraries: Encoding with fluorescent colloids in combinatorial chemistry

2000

Journal Article

Maximal sets of Hamilton cycles in Kn,n

Bryant, DE, El-Zanati, S and Rodger, CA (2000). Maximal sets of Hamilton cycles in Kn,n. Journal of Graph Theory, 33 (1), 25-31. doi: 10.1002/(SICI)1097-0118(200001)33:13.0.CO;2-T

Maximal sets of Hamilton cycles in Kn,n

2000

Journal Article

On Alspach's conjecture with two even cycle lengths

Adams, P, Bryant, DE and Khodkar, A (2000). On Alspach's conjecture with two even cycle lengths. Discrete Mathematics, 223 (1-3), 1-12. doi: 10.1016/S0012-365X(00)00051-0

On Alspach's conjecture with two even cycle lengths

2000

Journal Article

The spectrum problem for close m- trails, m 10

Adams, P., Bryant, D. E. and Khodkar, A. (2000). The spectrum problem for close m- trails, m 10. Journal of Combinatorial Mathematics and Combinatorial Computing, 34, 223-240.

The spectrum problem for close m- trails, m 10

2000

Journal Article

The fine structure of (v, 3) directed triple systems: v equivalent to 2 (mod 3)

Adams, P, Bryant, DE and Khodkar, A (2000). The fine structure of (v, 3) directed triple systems: v equivalent to 2 (mod 3). Ars Combinatoria, 57, 3-11.

The fine structure of (v, 3) directed triple systems: v equivalent to 2 (mod 3)

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.

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