Skip to menu Skip to content Skip to footer

2004

Journal Article

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

Bryant, D., Maenhaut, B., Quinn, K. and Webb, B. S. (2004). Existence and embeddings of partial Steiner triple systems of order ten with cubic leaves. Discrete Mathematics, 284 (1-3), 83-95. doi: 10.1016/j.disc.2004.01.009

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

2003

Conference Publication

Common multiples of complete graphs

Bryant, Darryn and Maenhaut, Barbara (2003). Common multiples of complete graphs. United Kingdom: Cambridge University Press. doi: 10.1112/S0024611502013771

Common multiples of complete graphs

2003

Journal Article

Skolem-type difference sets for cycle systems

Bryant, D., Gavlas, H. and Ling, A. C. H. (2003). Skolem-type difference sets for cycle systems. Electronic Journal of Combinatorics, 10 (1). doi: 10.37236/1731

Skolem-type difference sets for cycle systems

2003

Conference Publication

Inferring an original sequence from erroneous copies: A Bayesian approach

Keith, J. M., Adams, P., Bryant, D. E., Mitchelson, K. R., Cochran, D.A.E. and Lala, G. H. (2003). Inferring an original sequence from erroneous copies: A Bayesian approach. First Asia-Pacific Bioinformatics Conference, Adelaide Conference Centre, 3-6 February, 2003. Sydney: Australian Computer Society.

Inferring an original sequence from erroneous copies: A Bayesian approach

2003

Journal Article

On the volume of 4-cycle trades

Bryant, D., Grannell, M., Griggs, T. and Maenhaut, B. (2003). On the volume of 4-cycle trades. Graphs And Combinatorics, 19 (1), 53-63. doi: 10.1007/s00373-002-0484-x

On the volume of 4-cycle trades

2003

Journal Article

Large sets of large sets of Steiner triple systems of order 9

Bryant, D., Grannell, M. and Griggs, T. (2003). Large sets of large sets of Steiner triple systems of order 9. Utilitas Mathematica, 64, 115-118.

Large sets of large sets of Steiner triple systems of order 9

2003

Journal Article

Factorizations of the complete graph into C-5-factors and 1-factors

Adams, P, Bryant, D, El-Zanati, SI and Gavlas, H (2003). Factorizations of the complete graph into C-5-factors and 1-factors. Graphs And Combinatorics, 19 (3), 289-296. doi: 10.1007/s00373-002-0509-5

Factorizations of the complete graph into C-5-factors and 1-factors

2003

Journal Article

Least common multiples of cubes

Adams, P., Bryant, D. E., El-Zanati, S. I., Vanden Eynden, C. and Maenhaut, B. (2003). Least common multiples of cubes. Bulletin of the Institute of Combinatorics and its Applications, 38, 45-49.

Least common multiples of cubes

2003

Journal Article

Inferring an original sequence from erroneous copies: two approaches

Keith, J. M., Adams, P., Bryant, D. E., Mitchelson, K. R., Cochran, D.A.E. and Lala, G. H. (2003). Inferring an original sequence from erroneous copies: two approaches. Asia-Pacific Biotech News: Special Issue: Bioinformatics in Asia Pacific, 7 (3), 107-114. doi: 10.1142/s0219030303000284

Inferring an original sequence from erroneous copies: two approaches

2002

Journal Article

A family of perfect factorisations of complete bipartite graphs

Bryant, Darryn, Maenhaut, Barbara M. and Wanless, Ian M. (2002). A family of perfect factorisations of complete bipartite graphs. Journal of Combinatorial Theory Series A, 98 (2), 328-342. doi: 10.1006/jcta.2001.3240

A family of perfect factorisations of complete bipartite graphs

2002

Journal Article

A subset-oriented algorithm for minimizing the number of steps required for synthesis of cyclic-peptide libraries

Tran, T. T., Bryant, D. E. and Smythe, M. L. (2002). A subset-oriented algorithm for minimizing the number of steps required for synthesis of cyclic-peptide libraries. Computers and Chemistry, 26 (2), 113-117. doi: 10.1016/S0097-8485(01)00087-0

A subset-oriented algorithm for minimizing the number of steps required for synthesis of cyclic-peptide libraries

2002

Journal Article

Factorizations of and by powers of complete graphs

Bryant, D. E., El-Zanati, S. I. and Vanden Eynden, C. (2002). Factorizations of and by powers of complete graphs. Discrete Mathematics, 243 (1-3), 201-205. doi: 10.1016/S0012-365X(01)00216-3

Factorizations of and by powers of complete graphs

2002

Journal Article

On the possible volumes of mu-way latin trades

Adams, P., Billington, E. J., Bryant, D. E. and Mahmoodian, E. (2002). On the possible volumes of mu-way latin trades. Aequationes Mathematicae, 63 (3), 303-320. doi: 10.1007/s00010-002-8026-4

On the possible volumes of mu-way latin trades

2002

Journal Article

A conjecture on small embeddings of partial Steiner triple systems

Bryant, D (2002). A conjecture on small embeddings of partial Steiner triple systems. Journal of Combinatorial Designs, 10 (5), 313-321. doi: 10.1002/jcd.10017

A conjecture on small embeddings of partial Steiner triple systems

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

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

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

Another quick proof that K10 P + P + P

Bryant, D. E. (2002). Another quick proof that K10 P + P + P. Bulletin of the Institute of Combinatorics and its Applications, 34, 86-86.

Another quick proof that K10 P + P + P

2002

Journal Article

A subset-orientated algorithm for minimizing the number of steps required for synthesis of cyclic-peptide libraries

Tran, Tran Trung, Bryant, Darryn and Smythe, Mark (2002). A subset-orientated algorithm for minimizing the number of steps required for synthesis of cyclic-peptide libraries. Computers and Chemistry, 26 (2), 113-7. doi: 10.1016/S0097-8485(01)00087-0

A subset-orientated algorithm for minimizing the number of steps required for synthesis of cyclic-peptide libraries

2002

Journal Article

Orthogonal quasigroups associated with m-cycle systems

Bryant, D. E. and Khodkar, A. (2002). Orthogonal quasigroups associated with m-cycle systems. Bulletin of the Institute of Combinatorics and its Applications, 36, 109-112.

Orthogonal quasigroups associated with m-cycle systems