The packing and covering of the complete graph. I: The forests of order five
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.
scientific article; zbMATH DE number 3983185