Hostname: page-component-586b7cd67f-t7fkt Total loading time: 0 Render date: 2024-11-29T17:08:07.074Z Has data issue: false hasContentIssue false

Partial graph design embeddings and related problems

Published online by Cambridge University Press:  17 April 2009

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

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
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), 6978.CrossRefGoogle Scholar
[2]Hoffman, D.G. and Lindner, C.C., ‘A partial K 4e-design of order n can be embedded in a K 4e-design of order at most 8n + 16√n + 82’, Australas. J. Combin. 29 (2004), 225230.Google Scholar
[3]Kramer, E.S., ‘Indecomposable triple systems’, Discrete Math. 8 (1974), 173180.CrossRefGoogle Scholar
[4]Wilson, R.M., ‘Decompositions of complete graphs into subgraphs isomorphic to a given graph’, Congr. Numer. 15 (1976), 647659.Google Scholar