×

zbMATH — the first resource for mathematics

The packing and covering of the complete graph. I: The forests of order five. (English) Zbl 0608.05028
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.

MSC:
05C05 Trees
05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
PDF BibTeX XML Cite
Full Text: DOI EuDML