Dr Barbara Maenhaut's research interests are in combinatorial design theory and graph theory.
She received her PhD from the University of Queensland in 1999. Her current research projects are in the fields of:
Journal Article: Uniform decompositions of complete multigraphs into cycles
Berry, Duncan, Bryant, Darryn, Dean, Matthew and Maenhaut, Barbara (2018). Uniform decompositions of complete multigraphs into cycles. Journal of Combinatorial Designs, 26 (12), 595-615. doi: 10.1002/jcd.21630
Journal Article: On Hamilton decompositions of infinite circulant graphs
Bryant, Darryn, Herke, Sarada, Maenhaut, Barbara and Webb, Bridget S. (2018). On Hamilton decompositions of infinite circulant graphs. Journal of Graph Theory, 88 (3), 434-448. doi: 10.1002/jgt.22223
Journal Article: Decompositions of complete multigraphs into cycles of varying lengths
Bryant, Darryn, Horsley, Daniel, Maenhaut, Barbara and Smith, Benjamin R. (2018). Decompositions of complete multigraphs into cycles of varying lengths. Journal of Combinatorial Theory Series B, 129, 79-106. doi: 10.1016/j.jctb.2017.09.005
(2013–2015) ARC Discovery Projects
(2012–2014) ARC Linkage Projects
Uniform graph decompositions
Doctor Philosophy
Uniform cycle decompositions of complete multigraphs
(2018) Master Philosophy
Perfect 1-Factorisations of Circulant Graphs
(2014) Doctor Philosophy
Uniform decompositions of complete multigraphs into cycles
Berry, Duncan, Bryant, Darryn, Dean, Matthew and Maenhaut, Barbara (2018). Uniform decompositions of complete multigraphs into cycles. Journal of Combinatorial Designs, 26 (12), 595-615. doi: 10.1002/jcd.21630
On Hamilton decompositions of infinite circulant graphs
Bryant, Darryn, Herke, Sarada, Maenhaut, Barbara and Webb, Bridget S. (2018). On Hamilton decompositions of infinite circulant graphs. Journal of Graph Theory, 88 (3), 434-448. doi: 10.1002/jgt.22223
Decompositions of complete multigraphs into cycles of varying lengths
Bryant, Darryn, Horsley, Daniel, Maenhaut, Barbara and Smith, Benjamin R. (2018). Decompositions of complete multigraphs into cycles of varying lengths. Journal of Combinatorial Theory Series B, 129, 79-106. doi: 10.1016/j.jctb.2017.09.005
Bryant, Darryn, Maenhaut, Barbara and Smith, Benjamin R. (2018). On Hamilton decompositions of line graphs of non-hamiltonian graphs and graphs without separating transitions. Australasian Journal of Combinatorics, 71 (3), 537-543.
On factorisations of complete graphs into circulant graphs and the Oberwolfach problem
Alspach, Brian, Bryant, Darryn, Horsley, Daniel, Maenhaut, Barbara and Scharaschkin, Victor (2016). On factorisations of complete graphs into circulant graphs and the Oberwolfach problem. Ars Mathematica Contemporanea, 11 (1), 157-173. doi: 10.26493/1855-3974.770.150
Face 2-colorable embeddings with faces of specified lengths
Maenhaut, Barbara and Smith, Benjamin R (2015). Face 2-colorable embeddings with faces of specified lengths. Journal of Graph Theory, 82 (3), 296-311. doi: 10.1002/jgt.21902
Perfect 1-factorizations of a family of Cayley graphs
Herke, Sarada and Maenhaut, Barbara (2014). Perfect 1-factorizations of a family of Cayley graphs. Journal of Combinatorial Designs, 23 (9), 369-399. doi: 10.1002/jcd.21399
Decompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphs
Bryant, Darryn, Herke, Sarada, Maenhaut, Barbara and Wannasit, Wannasiri (2014). Decompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphs. Australasian Journal of Combinatorics, 60 (2), 227-254.
Perfect 1-factorisations of circulants with small degree
Herke, Sarada and Maenhaut, Barbara (2013). Perfect 1-factorisations of circulants with small degree. Electronic Journal of Combinatorics, 20 (1). doi: 10.37236/2264
Bryant, Darryn, Cavenagh, Nicholas J., Maenhaut, Barbara, Pula, Kyle and Wanless, Ian M. (2012). Nonextendible Latin Cuboids. Siam Journal on Discrete Mathematics, 26 (1), 239-249. doi: 10.1137/110825534
On the non-existence of pair covering designs with at least as many points as blocks
Bryant, Darryn, Buchanan, Melinda, Horsley, Daniel, Maenhaut, Barbara and Scharaschkin, Victor (2011). On the non-existence of pair covering designs with at least as many points as blocks. Combinatorica, 31 (5), 507-528. doi: 10.1007/s00493-011-2639-y
Cycle Decompositions of Complete Multigraphs
Bryant, D, Horsley, D, Maenhaut, B and Smith, BR (2011). Cycle Decompositions of Complete Multigraphs. Journal of Combinatorial Designs, 19 (1), 42-69. doi: 10.1002/jcd.20263
Indivisible plexes in latin squares
Bryant, D., Egan, J., Maenhaut, B. and Wanless, I. M. (2009). Indivisible plexes in latin squares. Designs, Codes and Cryptography, 52 (1), 93-105. doi: 10.1007/s10623-009-9269-z
Almost regular edge colorings and regular decompositions of complete graphs
Bryant, D. and Maenhaut, B. (2008). Almost regular edge colorings and regular decompositions of complete graphs. Journal of Combinatorial Designs, 16 (6), 499-506. doi: 10.1002/jcd.20190
Subsquare-free Latin squares of odd order
Maenhaut, B., Wanless, I. M. and Webb, B. S. (2007). Subsquare-free Latin squares of odd order. European Journal of Combinatorics, 28 (1), 322-336. doi: 10.1016/j.ejc.2005.07.002
New families of atomic Latin squares and perfect 1-factorisations
Bryant, Darryn, Maenhaut, Barbara and Wanless, Ian M. (2006). New families of atomic Latin squares and perfect 1-factorisations. Journal of Combinatorial Theory Series A, 113 (4), 608-624. doi: 10.1016/j.jcta.2005.05.003
Decomposition of complete graphs into 5-cubes
Bryant, 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
Decompositions into 2-regular subgraphs and equitable partial cycle decompositions
Bryant, 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
Atomic Latin squares of order eleven
Maenhaut, 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
Common multiples of complete graphs and a 4-cycle
Adams, 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
Cube factorizations of complete graphs
Adams, 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
Decompositions of complete graphs into triangles and Hamilton cycles
Bryant, 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
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
Further results on strongbox secured secret sharing schemes
Gamble, G, Maenhaut, BM, Seberry, J and Street, AP (2004). Further results on strongbox secured secret sharing schemes. Utilitas Mathematica, 66, 165-193.
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.
More on exact bicoverings of 12 points
Grannell, MJ, Griggs, TS, Quinn, KAS, Maenhaut, BM and Stanton, RG (2003). More on exact bicoverings of 12 points. Ars Combinatoria, 69, 197-213.
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
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
On the volume of 5-cycle trades
Maenhaut, B. M. (2001). On the volume of 5-cycle trades. Graphs And Combinatorics, 17 (2), 315-328. doi: 10.1007/s003730170045
Intersection problem for maximum pentagon packings
Maenhaut, B. (2000). Intersection problem for maximum pentagon packings. Journal of Combinatorial Mathematics and Combinatorial Computing, 32, 65-78.
Group divisible pentagon systems
Billington, E. J., Hoffman, D. G. and Maenhaut, B. H. (1999). Group divisible pentagon systems. Utilitas Mathematica, 55 (May 1999), 211-219.
Bryant, Darryn E. and Maenhaut, Barbara M. (1998). Defining sets of G-designs. The Australasian Journal of Combinatorics, 17, 257-266.
The intersection problem for group divisible pentagon systems
Maenhaut, Barbara M. (1998). The intersection problem for group divisible pentagon systems. Bulletin of the Institute of Combinatorics and its Applications, 24, 73-78.
Pointwise defining sets and trade cores
Delaney, 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.
Enhancing the student experience in mathematics through the use of a group project
Worsley, S. R., Hibberd, K. E. and Maenhaut, B. M. (2007). Enhancing the student experience in mathematics through the use of a group project. EMAC 2007: 8th Biennial Engineering Mathematics and Applications Conference, Hobart, TAS, Australia, 1-4 July, 2007. Cambridge, United Kingdom: Cambridge University Press. doi: 10.0000/anziamj.v49i0.371
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
(2013–2015) ARC Discovery Projects
(2012–2014) ARC Linkage Projects
Uniform graph decompositions
Doctor Philosophy — Principal Advisor
Other advisors:
Computational complexity of topological problems
Doctor Philosophy — Associate Advisor
Other advisors:
Uniform cycle decompositions of complete multigraphs
(2018) Master Philosophy — Principal Advisor
Other advisors:
Perfect 1-Factorisations of Circulant Graphs
(2014) Doctor Philosophy — Principal Advisor
Other advisors:
(2014) Doctor Philosophy — Associate Advisor
Other advisors:
(2014) Doctor Philosophy — Associate Advisor
Other advisors:
Some results on decompositions of circulant graphs and embeddings of partial cycle systems
(2011) Doctor Philosophy — Associate Advisor
Other advisors:
Some results on Steiner Triple Systems and Cycle Decompositions
(2008) Doctor Philosophy — Associate Advisor
Other advisors:
Topics in Graph Decomposition and Related Algebras
(2008) Doctor Philosophy — Associate Advisor
Other advisors: