default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBarbara M. Maenhaut
Person information
- affiliation: University of Queensland, School of Mathematics and Physics, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j21]Sara Davies, Barbara M. Maenhaut, Jeremy Mitchell:
Perfect $1$-factorisations of complete $k$-uniform hypergraphs. Australas. J Comb. 85: 35-48 (2023)- 2018
- [j20]Darryn E. Bryant
, Daniel Horsley, Barbara M. Maenhaut, Benjamin R. Smith:
Decompositions of complete multigraphs into cycles of varying lengths. J. Comb. Theory B 129: 79-106 (2018) - [j19]Darryn E. Bryant, Sarada Herke, Barbara M. Maenhaut, Bridget S. Webb:
On Hamilton decompositions of infinite circulant graphs. J. Graph Theory 88(3): 434-448 (2018) - 2016
- [j18]Brian Alspach, Darryn E. Bryant, Daniel Horsley, Barbara M. Maenhaut, Victor Scharaschkin:
On factorisations of complete graphs into circulant graphs and the Oberwolfach problem. Ars Math. Contemp. 11(1): 157-173 (2016) - [j17]Barbara M. Maenhaut, Benjamin R. Smith:
Face 2-Colorable Embeddings with Faces of Specified Lengths. J. Graph Theory 82(3): 296-311 (2016) - 2014
- [j16]Darryn E. Bryant, Sarada Herke, Barbara M. Maenhaut, Wannasiri Wannasit:
Decompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphs. Australas. J Comb. 60: 227-254 (2014) - 2013
- [j15]Sarada Herke, Barbara M. Maenhaut:
Perfect 1-Factorisations of Circulants with Small Degree. Electron. J. Comb. 20(1): 58 (2013) - 2012
- [j14]Darryn E. Bryant, Nicholas J. Cavenagh, Barbara M. Maenhaut, Kyle Pula, Ian M. Wanless:
Nonextendible Latin Cuboids. SIAM J. Discret. Math. 26(1): 239-249 (2012) - 2011
- [j13]Darryn E. Bryant, Melinda Buchanan, Daniel Horsley, Barbara M. Maenhaut, Victor Scharaschkin:
On the non-existence of pair covering designs with at least as many points as blocks. Comb. 31(5): 507-528 (2011) - 2009
- [j12]Darryn E. Bryant, Judith Egan, Barbara M. Maenhaut, Ian M. Wanless:
Indivisible plexes in latin squares. Des. Codes Cryptogr. 52(1): 93-105 (2009) - 2007
- [j11]Barbara M. Maenhaut, Ian M. Wanless, Bridget S. Webb:
Subsquare-free Latin squares of odd order. Eur. J. Comb. 28(1): 322-336 (2007) - 2006
- [j10]Darryn E. Bryant, Barbara M. Maenhaut, Ian M. Wanless:
New families of atomic Latin squares and perfect 1-factorisations. J. Comb. Theory A 113(4): 608-624 (2006) - 2005
- [j9]Darryn E. Bryant, Daniel Horsley, Barbara M. Maenhaut:
Decompositions into 2-regular subgraph and equitable partial cycle decompositions. J. Comb. Theory B 93(1): 67-72 (2005) - 2004
- [j8]Peter Adams, Darryn E. Bryant, Barbara M. Maenhaut:
Common multiples of complete graphs and a 4-cycle. Discret. Math. 275(1-3): 289-297 (2004) - [j7]Darryn E. Bryant, Barbara M. Maenhaut, Kathleen A. S. Quinn, Bridget S. Webb:
Existence and embeddings of partial Steiner triple systems of order ten with cubic leaves. Discret. Math. 284(1-3): 83-95 (2004) - 2003
- [j6]Mike J. Grannell, Terry S. Griggs, Kathleen A. S. Quinn, Barbara M. Maenhaut, Ralph Gordon Stanton:
More on exact bicoverings of 12 points. Ars Comb. 69 (2003) - [j5]Darryn E. Bryant, Mike J. Grannell, Terry S. Griggs, Barbara M. Maenhaut:
On the Volume of 4-Cycle Trades. Graphs Comb. 19(1): 53-63 (2003) - 2002
- [j4]Darryn E. Bryant, Barbara M. Maenhaut, Ian M. Wanless:
A Family of Perfect Factorisations of Complete Bipartite Graphs. J. Comb. Theory A 98(2): 328-342 (2002) - 2001
- [j3]Barbara M. Maenhaut:
On the Volume of 5-Cycle Trades. Graphs Comb. 17(2): 315-328 (2001) - 1998
- [j2]Darryn E. Bryant, Barbara M. Maenhaut:
Defining sets of G-designs. Australas. J Comb. 17: 257-266 (1998) - 1997
- [j1]Cathy Delaney, Brenton D. Gray, Ken Gray, Barbara M. Maenhaut, Martin J. Sharry, Anne Penfold Street:
Pointwise defining sets and trade cores. Australas. J Comb. 16: 51-76 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
