|
2001 Journal Article The mu-way intersection problem for m-cycle systemsAdams, 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 |
|
2001 Journal Article On the intersection problem for 1-factorizations and near 1-factorizations of K-vBryant, DE and Khodkar, A (2001). On the intersection problem for 1-factorizations and near 1-factorizations of K-v. Utilitas Mathematica, 60, 209-218. |
|
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. |
|
2001 Journal Article The m-way intersection problem for cubesAdams, P. and Bryant, D. E. (2001). The m-way intersection problem for cubes. Australas. J. Combin., 23, 87-100. |
|
2001 Journal Article Star factorizations of graph productsBryant, 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 |
|
2000 Journal Article Encoding combinatorial libraries: A novel application of fluorescent silica colloidsGrondahl, 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 |
|
2000 Journal Article The line structure of balanced ternary designs with block size three, index three and rho(2) = 1, 2Adams, 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. |
|
2000 Journal Article Maximum packings of K-v-K-u with triplesBryant, D. E. and Khodkar, A. (2000). Maximum packings of K-v-K-u with triples. Ars Combinatoria, 55, 259-270. |
|
2000 Journal Article Toward larger chemical libraries: Encoding with fluorescent colloids in combinatorial chemistryBattersby, 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 |
|
2000 Journal Article Maximal sets of Hamilton cycles in Kn,nBryant, 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 |
|
2000 Journal Article On Alspach's conjecture with two even cycle lengthsAdams, 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 |
|
2000 Journal Article The spectrum problem for close m- trails, m 10Adams, 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. |
|
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. |
|
2000 Journal Article The spectrum problem for lambda-fold Petersen graph designsAdams, P., Bryant, D. E. and Khodkar, A. (2000). The spectrum problem for lambda-fold Petersen graph designs. Journal of Combinatorial Mathematics and Combinatorial Computing, 34, 159-176. |
|
1999 Journal Article The possible number of cycles in cycle systemsBillington, EJ and Bryant, DE (1999). The possible number of cycles in cycle systems. ARS Combinatoria, 52, 65-70. |
|
1999 Journal Article Strongly 2-perfect trail systems and related quasigroupsBryant, D. E. and Oates-Williams, S. (1999). Strongly 2-perfect trail systems and related quasigroups. Australasian Journal of Combinatorics, 20, 101-110. |
|
1999 Journal Article Small embeddings for partial G-designs when G is bipartiteBryant, D. E., Khodkar, A. and El-Zanati, S. I. (1999). Small embeddings for partial G-designs when G is bipartite. Bulletin of the Institute of Combinatorics and its Applications, 26, 86-90. |
|
1999 Journal Article Packing and covering the complete graph with cubesAdams, P., Bryant, D. E. and El-Zanati, S. I. (1999). Packing and covering the complete graph with cubes. Australasian Journal of Combinatorics, 20, 267-288. |
|
1999 Journal Article On the number of repeated triples in balanced ternary designs with index twoAdams, P, Bryant, DE and Khodkar, A (1999). On the number of repeated triples in balanced ternary designs with index two. Utilitas Mathematica, 55, 55-64. |
|
1998 Journal Article Generalized optimal lattice covering of finite-dimensional Euclidean spaceBryant, Darryn, Diamond, Phil and Vladimirov, Igor (1998). Generalized optimal lattice covering of finite-dimensional Euclidean space. Linear Algebra and Its Applications, 282 (1-3), 311-324. |
