×

Some results on the Oberwolfach problem. (Decomposition of complete graphs into isomorphic quadratic factors.). (English) Zbl 0297.05141


MSC:

05C99 Graph theory
05C35 Extremal problems in graph theory
PDFBibTeX XMLCite
Full Text: DOI EuDML

References:

[1] Berge, C.,Théorie des graphes et ses applications (Paris, Dunod 1958).
[2] Guy, R. K.,Unsolved Combinatorial Problems, Combinatorial Mathematics and its Applications, in Proc. Confer. Oxford 1969 (Academic Press, N. Y. 1971), pp. 121–127.
[3] Hall, M. Jr.,Combinatorial Theory (Ginn-Blaisdell, Waltham, Mass. 1967).
[4] Hell, P. andRosa, A.,Graph Decompositions, Handcuffed Prisoners and Balanced P-designs, Discrete Math.2, 229–252 (1972). · Zbl 0251.05015
[5] König, D.,Theorie der endlichen Graphen (Leipzig 1936). · JFM 62.0654.05
[6] Ray-Chaudhuri, D. K. andWilson, R. M.,Solution of Kirkman’s Schoolgirl Problem, in Proc. Sympos. Pure Math.19, Combinatorics, Amer. Math. Soc., 1971, pp. 187–204. · Zbl 0248.05009
[7] Ray-Chaudhuri, D. K. andWilson, R. M.,The Existence of Resolvable Block Designs, in A Survey of Combinatorial Theory [edited by J. N. Srivastavaet al.] (North-Holland, Amsterdam 1973), pp. 361–375.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.