|
2006 Journal Article Decomposition of complete graphs into 5-cubesBryant, 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 |
|
2005 Journal Article Decompositions into 2-regular subgraphs and equitable partial cycle decompositionsBryant, 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 |
|
2004 Journal Article Cube factorizations of complete graphsAdams, 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 |
|
2004 Journal Article Atomic Latin squares of order elevenMaenhaut, B. M. and Wanless, I. M. (2004). Atomic Latin squares of order eleven. Journal of Combinatorial Designs, 12 (1), 12-34. doi: 10.1002/jcd.10064 |
|
2004 Journal Article Decompositions of complete graphs into triangles and Hamilton cyclesBryant, 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 |
|
2004 Journal Article Further results on strongbox secured secret sharing schemesGamble, G, Maenhaut, BM, Seberry, J and Street, AP (2004). Further results on strongbox secured secret sharing schemes. Utilitas Mathematica, 66, 165-193. |
|
2004 Journal Article Common multiples of complete graphs and a 4-cycleAdams, 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 |
|
2004 Journal Article Existence and embeddings of partial Steiner triple systems of order ten with cubic leavesBryant, 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 |
|
2003 Conference Publication Common multiples of complete graphsBryant, Darryn and Maenhaut, Barbara (2003). Common multiples of complete graphs. United Kingdom: Cambridge University Press. doi: 10.1112/S0024611502013771 |
|
2003 Journal Article More on exact bicoverings of 12 pointsGrannell, MJ, Griggs, TS, Quinn, KAS, Maenhaut, BM and Stanton, RG (2003). More on exact bicoverings of 12 points. Ars Combinatoria, 69, 197-213. |
|
2003 Journal Article On the volume of 4-cycle tradesBryant, 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 |
|
2003 Journal Article Least common multiples of cubesAdams, 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. |
|
2002 Journal Article A family of perfect factorisations of complete bipartite graphsBryant, 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 |
|
2001 Journal Article On the volume of 5-cycle tradesMaenhaut, B. M. (2001). On the volume of 5-cycle trades. Graphs And Combinatorics, 17 (2), 315-328. doi: 10.1007/s003730170045 |
|
2000 Journal Article Intersection problem for maximum pentagon packingsMaenhaut, B. (2000). Intersection problem for maximum pentagon packings. Journal of Combinatorial Mathematics and Combinatorial Computing, 32, 65-78. |
|
1999 Journal Article Group divisible pentagon systemsBillington, E. J., Hoffman, D. G. and Maenhaut, B. H. (1999). Group divisible pentagon systems. Utilitas Mathematica, 55 (May 1999), 211-219. |
|
1998 Journal Article Defining sets of G-designsBryant, Darryn E. and Maenhaut, Barbara M. (1998). Defining sets of G-designs. The Australasian Journal of Combinatorics, 17, 257-266. |
|
1998 Journal Article The intersection problem for group divisible pentagon systemsMaenhaut, Barbara M. (1998). The intersection problem for group divisible pentagon systems. Bulletin of the Institute of Combinatorics and its Applications, 24, 73-78. |
|
1998 Other Outputs Substructures of cycle systems with applications to access schemesMaenhaut, Barbara M. (1998). Substructures of cycle systems with applications to access schemes. PhD Thesis, School of Physical Sciences, The University of Queensland. doi: 10.14264/6666821 |
|
1997 Journal Article Pointwise defining sets and trade coresDelaney, Cathy, Gray, Brenton D., Gray, Ken, Maenhaut, Barbara M., Sharry, Martin J. and Street, Anne Penfold (1997). Pointwise defining sets and trade cores. Australasian Journal of Combinatorics, 16, 51-76. |
