|
2002 Journal Article C4-saturated bipartite graphsBryant, DE and Fu, HL (2002). C4-saturated bipartite graphs. Discrete Mathematics, 259 (1-3), 263-268. doi: 10.1016/S0012-365X(02)00371-0 |
|
2002 Journal Article The three-way intersection problem for latin squaresAdams, 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 |
|
2002 Journal Article Decompositions of the complete graph into small 2-regular graphsAdams, 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. |
|
2001 Journal Article Star decompositions of cubesBryant, 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 |
|
2001 Journal Article On the Oberwolfach problem with two similar length cyclesBryant, DE (2001). On the Oberwolfach problem with two similar length cycles. Graphs And Combinatorics, 17 (2), 199-206. doi: 10.1007/s003730170033 |
|
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 Conference Publication Colloidal barcoding in combinatorial chemistryBattersby, 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. |
|
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 |
|
2001 Journal Article Applications of graph theory in DNA sequencing by hybridizationAdams, 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. |
|
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. |
