Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-27T08:44:39.384Z Has data issue: false hasContentIssue false
  • English
  • Français

DECOMPOSITIONS OF GENERALIZED COMPLETE GRAPHS

Part of: Graph theory

Published online by Cambridge University Press:  02 October 2009

BENJAMIN R. SMITH
BENJAMIN R. SMITH*
Affiliation:
School of Mathematics and Physics, The University of Queensland, Brisbane 4072, Australia (email: [email protected])
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.'

Keywords

graph decompositionk-cyclegeneralized complete graph

MSC classification

Secondary: 05C70: Factorization, matching, partitioning, covering and packing 05C15: Coloring of graphs and hypergraphs
Type
PhD thesis
Information
Bulletin of the Australian Mathematical Society , Volume 80 , Issue 3 , December 2009 , pp. 523 - 525
Copyright
Copyright © Australian Mathematical Publishing Association Inc. 2009

References

[1]Alspach, B. and Gavlas, H., ‘Cycle decompositions of K n and K n−I’, J. Combin. Theory Ser. B 81 (2001), 77–99.CrossRefGoogle Scholar
[2]Billington, E. J., Hoffman, D. G. and Maenhaut, B. M., ‘Group divisible pentagon systems’, Util. Math. 55 (1999), 211–219.Google Scholar
[3]Cavenagh, N. J., ‘Decompositions of complete tripartite graphs into k-cycles’, Australas. J. Combin. 18 (1998), 193–200.Google Scholar
[4]Hanani, H., ‘Balanced incomplete block designs and related designs’, Discrete Math. 11 (1975), 255–369.CrossRefGoogle Scholar
[5]Manikandan, R. S. and Paulraja, P., ‘C p-decompositions of some regular graphs’, Discrete Math. 306 (2006), 429–451.CrossRefGoogle Scholar
[6]Šajna, M., ‘Cycle decompositions III: complete graphs and fixed length cycles’, J. Combin. Des. 10 (2002), 27–78.CrossRefGoogle Scholar
[7]Sotteau, D., ‘Decomposition of K m,n(K *m,n) into cycles (circuits) of length 2k’, J. Combin. Theory Ser. B 30 (1981), 75–81.CrossRefGoogle Scholar