Hostname: page-component-6bf8c574d5-mggfc Total loading time: 0 Render date: 2025-02-16T16:29:34.489Z Has data issue: false hasContentIssue false
  • English
  • Français

How Intricate are (2s + 1)-Factorizations?

Published online by Cambridge University Press:  20 November 2018

A. J. W. Hilton
A. J. W. Hilton*
Affiliation:
Department of Mathematics University of Reading Whiteknights, Reading U.K.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The intricacy of the problem of (2s + 1 )-factorizating Kn is determined. Some generalizations are also given.

Keywords

05C99
Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 30 , Issue 2 , 01 June 1987 , pp. 241 - 247
Copyright
Copyright © Canadian Mathematical Society 1987

References

1. Chetwynd, A.G. and Hilton, A. J.W., Regular graphs of high degree are I-factor liable, Proc. London Math. Soc, 50 (1985), pp. 193–206.Google Scholar
2. Chvatal, V., On Hamilton s Ideals, J. Comb. Theory (B), 12 (1972), pp. 163–168.Google Scholar
3. Dirac, G.A., Some theorems on abstract graphs, Proc. London Math. Soc. (3), 2 (1952), pp. 69—81.Google Scholar
4. Hilton, A. J.W., Factorizations of regular graphs of high degree, J. Graph Theory, 9 (1985), 193–196.Google Scholar
5. Bill, Jackson, Edge-disjoint Hamilton cycles In regular graphs of large degree, J. London Math. Soc. (2), 19(1979), pp. 13–16.Google Scholar
6. Opencomb, W.E., On the intricacy of combinatorial construction problems, Discrete Math. 50 (1984), pp. 71–97.Google Scholar
7. Petersen, J., Die Thorie der regulären Graphen, Acta Math., 15 (1891), pp. 193–220.Google Scholar