Hostname: page-component-6bf8c574d5-t27h7 Total loading time: 0 Render date: 2025-02-26T13:54:45.897Z Has data issue: false hasContentIssue false
  • English
  • Français

Partial graph design embeddings and related problems

Published online by Cambridge University Press:  17 April 2009

Peter Jenkins
Peter Jenkins
Affiliation:
Centre for Discrete Mathematics and Computing, Department of Mathematics, The University of Queensland, Queensland 4072, Australia
Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Abstracts of Australasian Ph.D. Theses
Information
Bulletin of the Australian Mathematical Society , Volume 73 , Issue 1 , February 2006 , pp. 159 - 160
Copyright
Copyright © Australian Mathematical Society 2006

References

[1]Heinrich, K. and Zhu, L., ‘Existence of orthogonal latin squares with aligned subsquares’, Discrete Math. 59 (1986), 69–78.CrossRefGoogle Scholar
[2]Hoffman, D.G. and Lindner, C.C., ‘A partial K 4 ∖ e-design of order n can be embedded in a K 4 ∖ e-design of order at most 8n + 16√n + 82’, Australas. J. Combin. 29 (2004), 225–230.Google Scholar
[3]Kramer, E.S., ‘Indecomposable triple systems’, Discrete Math. 8 (1974), 173–180.CrossRefGoogle Scholar
[4]Wilson, R.M., ‘Decompositions of complete graphs into subgraphs isomorphic to a given graph’, Congr. Numer. 15 (1976), 647–659.Google Scholar