Publications (Last updated May 2014)

1997

Cathy Delaney, Brenton D. Gray, Ken Gray, Barbara M. Maenhaut, Martin J. Sharry and Anne Penfold Street, Pointwise Defining Sets and Trade Cores, Australasian Journal of Combinatorics, 16 (1997) 51-76.

1998

Darryn E. Bryant and Barbara M. Maenhaut, Defining Sets of G-designs, Australasian Journal of Combinatorics,17 (1998) 257-266.

Barbara M. Maenhaut, The intersection problem for group divisible pentagon systems, Bulletin of the Institute of Combinatorics and its Applications, 24 (1998) 73-78.

1999

Elizabeth J. Billington, D.G. Hoffman and Barbara M. Maenhaut, Group Divisible Pentagon Systems, Utilitas Mathematica, 55 (1999) 211-219.

2000

Barbara M. Maenhaut, The intersection problem for maximum pentagon packings, Journal of Combinatorial Mathematics and Combinatorial Computing, 32 (2000) 65-78.

2001

Barbara M. Maenhaut, On the volume of 5-cycle trades, Graphs and Combinatorics, 17 (2001) 315-328.

2002

Darryn Bryant, Barbara Maenhaut and Ian Wanless, A family of perfect factorisations of complete bipartite graphs, Journal of Combinatorial Theory Series A, 98 (2002) 328-342.

2003

Darryn Bryant and Barbara Maenhaut, Common multiples of complete graphs, Proceedings of the London Mathematical Society, 86 (2003) 302-326.

Peter Adams, Darryn Bryant, Saad El-Zanati, Charles Vanden Eynden and Barbara Maenhaut, Least common multiples of cubes, Bulletin of the Institute of Combinatorics and its Applications, 38 (2003) 45-49.

Darryn Bryant, Mike Grannell, Terry Griggs and Barbara Maenhaut, On the volume of 4-cycle trades, Graphs and Combinatorics, 19 (2003) 53-63.

Mike Grannell, Terry Griggs, Kathleen Quinn, Barbara Maenhaut and Ralph Stanton, More on exact bicoverings of 12 points, Ars Combinatoria, 69 (2003) 197-213.

2004

Peter Adams, Darryn Bryant and Barbara Maenhaut, Common multiples of complete graphs and a 4-cycle, Discrete Mathematics, 275 (2004) 289-297.

Barbara Maenhaut and Ian Wanless, Atomic Latin Squares of Order Eleven, Journal of Combinatorial Designs, 12 (2004) 12-34.

Darryn Bryant and Barbara Maenhaut, Decompositions of complete graphs into triangles and Hamilton cycles, Journal of Combinatorial Designs, 12 (2004) 221-232.

Darryn Bryant, Barbara Maenhaut, Kathleen Quinn and Bridget Webb, Existence and embeddings of partial Steiner triple systems of order ten with cubic leaves, Discrete Mathematics (Special issue in honour of Curt Lindner on the occasion of his 65th birthday), 284 (2004) 83-95.

Peter Adams, Darryn Bryant and Barbara Maenhaut, Cube factorisations of complete graphs, Journal of Combinatorial Designs, 12 (2004) 381-388.

Greg Gamble, Barbara Maenhaut, Jennifer Seberry and Anne Street, Further Results on Strongbox Secured Secret Sharing Schemes, Utilitas Mathematica, 66 (2004) 165-194.

2005

Darryn Bryant, Daniel Horsley and Barbara Maenhaut, Decompositions into 2-regular subgraphs and equitable partial cycle decompositions, Journal of Combinatorial Theory, Series B, 93 (2005) 67-72.

2006

D. Bryant, S.I. El-Zanati, B.Maenhaut and C. Vanden Eynden, Decomposition of complete graphs into 5-cubes, Journal of Combinatorial Designs, 14 (2006) 159-166.

Darryn Bryant, Barbara Maenhaut and Ian Wanless, New families of atomic Latin squares and perfect one-factorisations, Journal of Combinatorial Theory Series A, 113 (2006) 608-624.

2007

Barbara Maenhaut, Ian Wanless and Bridget Webb, Subsquare-free Latin squares of odd order, European Journal of Combinatorics, 28 (2007) 322-336.

Susan Rachel Worsley, Katrina Hibberd and Barbara Maenhaut, Enhancing the student experience in mathematics through the use of a group project, ANZIAM Journal: Proceedings of the 8^th Biennial Engineering Mathematics and Applications Conference, 49 (2007) C200-C214.

2008

Darryn Bryant and Barbara Maenhaut, Almost regular edge colourings and regular decompositions of complete graphs, Journal of Combinatorial Designs 16 (2008) 499-506.

2009

Darryn Bryant, Judith Egan, Barbara Maenhaut and Ian M. Wanless, Indivisible plexes in latin squares, Designs Codes and Cryptography, 52 (2009) 93-105.

2011

Darryn Bryant, Daniel Horsley, Barbara Maenhaut and Benjamin R Smith, Cycle decompositions of complete multigraphs, Journal of Combinatorial Designs, 19 (2011) 42-69.

Darryn Bryant, Melinda Buchanan, Daniel Horsley, Barbara Maenhaut and Victor Scharaschkin, On the non-existence of pair covering designs with at least as many points as blocks, Combinatorica, 31 (2011) 507-528.

2012

Darryn Bryant, Nicholas J. Cavenagh, Barbara Maenhaut, Kyle Pula and Ian M. Wanless, Non-Extendible Latin Cuboids, SIAM J Disc Math, 26 (2012) 239-249.

2013

Sarada Herke and Barbara Maenhaut, Perfect 1-Factorisations of Circulants with small degree, Electronic Journal of Combinatorics, 20 (2013) P58.

2014

Darryn Bryant, Sarada Herke, Barbara Maenhaut and Wannasiri Wannasit, Decompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphs, Australas. J. Combin. 60 (2014), 227-254.

2015

Sarada Herke and Barbara Maenhaut, Perfect 1-factorizations of a family of Cayley graphs, J. Combin. Des.23 (2015), no. 9, 369-399.

2016

Brian Alspach, Darryn Bryant, Daniel Horsley, Barbara Maenhaut and Victor Scharaschkin, On factorisations of complete graphs into circulant graphs and the Oberwolfach problem, Ars Mathematica Contemporanea 11 (2016) 157-173.

To appear

Barbara Maenhaut and Benjamin Smith, Face 2-colourable embeddings with faces of specified lengths, Journal of Graph Theory, article first published online: 12 AUG 2015, DOI: 10.1002/jgt.21902.

Submitted

Darryn Bryant, Daniel Horsley, Barbara Maenhaut and Benjamin Smith, Decompositions of complete multigraphs into cycles of varying lengths.