We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
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.
[1] Alspach, B. and Gavlas, H., ‘Cycle decompositions of Kn − I’, J. Combin. Theory Ser. B812001, 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.242001, 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.231978, 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.102002, 27–78.CrossRefGoogle Scholar