Enclosings of λ-fold 4-cycle systems
In this paper we solve the problem of enclosing a λ-fold 4-cycle system of order v into a (λ + m)-fold 4-cycle system of order v + u for all m > 0 and u ≥ 1. An ingredient is constructed that is of interest on its own right, namely the problem of finding equitable partial 4-cycle systems of λ K v . This supplementary solution builds on a result of Raines and Staniszlo.
KeywordsEnclosing 4-cycles Embedding
Mathematics Subject Classification (2000)05B30 05C38
Unable to display preview. Download preview PDF.
- Colbourn C.J., Hamm R.C., Rosa A.: Embedding, immersing, and enclosing. In: Proceedings of the Sixteenth Southeastern international Conference on Combinatorics, Graph Theory and Computing Boca Raton, FL, 1985). Congr. Num. 47, 229–236 (1985).Google Scholar
- Newman N.A., Rodger C.A.: Enclosings of λ-fold triple systems. Utilitas Math. (to be published).Google Scholar
- Schonheim J., Bialistocki A.: Packing and covering the complete graph with 4-cycles. Can. Math. Bull. 18, 703–708 (1975)Google Scholar
- West D.B.: Introduction to Graph Theory. Prentice Hall (2001).Google Scholar