Associate Professor Barbara Maenhaut
Associate Professor

Barbara Maenhaut

Email: 
Phone: 
+61 7 336 53258

Background

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:

  • Graph decompositions
  • Latin squares and perfect one-factorisations

Availability

Associate Professor Barbara Maenhaut is:
Available for supervision

Fields of research

Combinatorics and discrete mathematics (excl. physical combinatorics) Mathematical Sciences Pure mathematics

Qualifications

  • Bachelor (Honours) of Mathematics, University of Waterloo
  • Doctor of Philosophy of Mathematics, The University of Queensland

Research interests

  • Graph decompositions

    A decomposition of a graph G is a set of subgraphs {H1, H2, ..., Ht} of G such that each edge of G occurs in precisely one subgraph Hi. If the subgraphs are each isomorphic to a graph H, then we say that H divides G. Recently, I have investigated several graph decomposition problems, including common multiples of pairs of graphs and decompositions into 2-regular graphs.

  • Latin squares

    A Latin square of order n is an n by n array of the symbols 1 to n in which each symbol occurs precisely once in each row and once in each column. I have recently been working with Dr Wanless (Monash) on Latin squares in which the permutation defined by any pair of rows is a full cycle, and on Latin cuboids (the generalisation of Latin squares to 3 dimensions).

Search Professor Barbara Maenhaut’s works on UQ eSpace

40 works between 1997 and 2023
All (40) Journal Article (35) Conference Publication (4) Other Outputs (1)

1 - 20 of 40 works

2023

Journal Article

Perfect 1-factorisations of complete k-uniform hypergraphs

Davies, Sara, Maenhaut, Barbara and Mitchell, Jeremy (2023). Perfect 1-factorisations of complete k-uniform hypergraphs. Australasian Journal of Combinatorics, 85 (1), 35-48.

Perfect 1-factorisations of complete k-uniform hypergraphs

2018

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

Uniform decompositions of complete multigraphs into cycles

2018

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

On Hamilton decompositions of infinite circulant graphs

2018

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

Decompositions of complete multigraphs into cycles of varying lengths

2018

Journal Article

On Hamilton decompositions of line graphs of non-hamiltonian graphs and graphs without separating transitions

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 Hamilton decompositions of line graphs of non-hamiltonian graphs and graphs without separating transitions

2017

Conference Publication

50 years of the Oberwolfach problem

Maenhaut, Barbara (2017). 50 years of the Oberwolfach problem. 5th International Combinatorics Conference, Melbourne, VIC, Australia, 5-9 December 2017.

50 years of the Oberwolfach problem

2016

Journal Article

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

On factorisations of complete graphs into circulant graphs and the Oberwolfach problem

2016

Conference Publication

Hamilton decompositions

Maenhaut, Barbara (2016). Hamilton decompositions. 30th Midwestern Conference on Combinatorics and Combinatorial Computing, Normal, ILL, United States, 14-16 October 2016.

Hamilton decompositions

2015

Journal Article

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

Face 2-colorable embeddings with faces of specified lengths

2014

Journal Article

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

Perfect 1-factorizations of a family of Cayley graphs

2014

Journal Article

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.

Decompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphs

2013

Journal Article

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

Perfect 1-factorisations of circulants with small degree

2012

Journal Article

Nonextendible Latin Cuboids

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

Nonextendible Latin Cuboids

2011

Journal Article

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

On the non-existence of pair covering designs with at least as many points as blocks

2011

Journal Article

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

Cycle Decompositions of Complete Multigraphs

2009

Journal Article

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

Indivisible plexes in latin squares

2008

Journal Article

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

Almost regular edge colorings and regular decompositions of complete graphs

2007

Conference Publication

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

Enhancing the student experience in mathematics through the use of a group project

2007

Journal Article

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

Subsquare-free Latin squares of odd order

2006

Journal Article

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

New families of atomic Latin squares and perfect 1-factorisations

Current funding

  • 2024 - 2028
    Fractional decomposition of graphs and the Nash-Williams conjecture (ARC Discovery Project externally administered by Monash University)
    Monash University
    Open grant

Past funding

  • 2013 - 2015
    Factorisations of graphs
    ARC Discovery Projects
    Open grant
  • 2012 - 2014
    Virtual Transport Networks
    ARC Linkage Projects
    Open grant

Availability

Associate Professor Barbara Maenhaut is:
Available for supervision

Before you email them, read our advice on how to contact a supervisor.

Supervision history

Current supervision

  • Doctor Philosophy

    Computational complexity of topological problems

    Associate Advisor

    Other advisors: Professor Benjamin Burton

Completed supervision

Enquiries

For media enquiries about Associate Professor Barbara Maenhaut's areas of expertise, story ideas and help finding experts, contact our Media team:

communications@uq.edu.au