Roditty, Y. The packing and covering of the complete graph. I: The forests of order five. (English) Zbl 0608.05028 Int. J. Math. Math. Sci. 9, 277-282 (1986). The maximum number of pairwise edge disjoint forests of order five in the complete graph \(K_ n\), and the minimum number of forests of order five whose union is \(K_ n\), are determined. Cited in 6 ReviewsCited in 5 Documents MSC: 05C05 Trees 05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) Keywords:packing; covering; decomposition; forests PDF BibTeX XML Cite \textit{Y. Roditty}, Int. J. Math. Math. Sci. 9, 277--282 (1986; Zbl 0608.05028) Full Text: DOI EuDML