Hostname: page-component-84b7d79bbc-g78kv Total loading time: 0 Render date: 2024-07-30T09:27:59.379Z Has data issue: false hasContentIssue false
  • English
  • Français

Theta graphs, graph decompositions and related graph labelling techniques

Published online by Cambridge University Press:  17 April 2009

Andrew Blinco
Andrew Blinco
Affiliation:
Department of Mathematics, The University of Queensland, Queensland 4072, Australia, e-mail: ablinco@stvcas.cas.ilstu.edu
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 69 , Issue 1 , February 2004 , pp. 173 - 175
Copyright
Copyright © Australian Mathematical Society 2004

References

[1] Alspach, B. and Gavlas, H., ‘Cycle decompositions of Kn − I’, J. Combin. Theory Ser. B 81 2001, 77–99.CrossRefGoogle Scholar
[2] El-Zanati, S.I., Vanden Eynden, C. and Punnim, N., ‘On the cyclic decomposition of complete graphs into bipartite graphs’, Australas. J. Combin. 24 2001, 209–219.Google Scholar
[3] Lindner, C.C. and Rodger, C.A., ‘Decomposition into Cycles II: Cycle Systems’, in Contemporary Design Theory: A Collection of Surveys, (Dinitz, J.H. and Stinson, D.R., Editors) (J. Wiley and Son, New York, 1992), PP. 325–369.Google Scholar
[4] Loerinc, B., ‘Chromatic uniqueness of the generalised θ-graph’, Discrete Math. 23 1978, 313–316.CrossRefGoogle Scholar
[5] Rosa, A., ‘On certain valuations of the vertices of a graph’, in Théorie ded graphes, journées internationales d'études, Rome 1966 (Dunod, Paris, 1967), pp. 349–355.Google Scholar
[6] Šajna, M., ‘Cycle decompositions III. Complete graphs and fixed length cycles’, J. Combin. Des. 10 2002, 27–78.CrossRefGoogle Scholar