참고문헌
- L. D. Andersen, Factorizations of graphs, in : CRC Handbook of Combinatorial Designs, C. J. Colbourn and J. H. Dinitz (eds), CRC Press, Boca Raton, FL, 1996, 653-667
- C. J. Colbourn and A. Rosa, Triple Systems, Oxford Mathematical Monographs. The Clarendon Press, Oxford University Press, New York, 1999
- J. Doyen and R. M. Wilson, Embeddings of Steiner triple systems, Discrete Math. 5 (1973), 229-239 https://doi.org/10.1016/0012-365X(73)90139-8
- A. Hartman, Tripling quadruple systems, Ars Combin. 10 (1980), 255-309
- E. Mendelsohn and A. Rosa, One-factorizations of the complete graph-a survey, J. Graph Theory 9 (1985), no. 1, 43-65 https://doi.org/10.1002/jgt.3190090104
- M. Reiss, Uber eine Steinersche combinatorische Aufgabe, welche im 45sten Banden dises Journals, Seite 181, gestellt worden ist, J. Reine Angew Math. 65 (1859), 226-244
- R. G. Stanton and I. P. Goulden, Graph factorization, general triple systems, and cyclic triple systems, Aequationes Math. 22 (1981), no. 1, 1-28 https://doi.org/10.1007/BF02190154
- G. Stern and H. Lenz, Steiner triple systems with given subspaces; another proof of the Doyen-Wilson-theorem, Boll. Un. Mat. Ital. A (5) 17 (1980), no. 1, 109-114
- W. D. Wallis, One-factorizations of the complete graph, in : Contemporary Design Theory : A Collection of Surveys, J. H. Dinitz and D. R. Stinson (eds), Wiley, New York, 1992, 593-631
- W. D. Wallis, One-factorizations, Mathematics and its Applications, 390. Kluwer Academic Publishers Group, Dordrecht, 1997