The packing and covering of the complete graph. I: The forests of order five
type: Item
instance of: scholarly article
title: The packing and covering of the complete graph. I: The forests of order five
zbMATH Open document ID: 0608.05028
DOI: 10.1155/S0161171286000340
published in: International Journal of Mathematics and Mathematical Sciences
publication date: 1986-01-01T00:00:00Z
full work available at URL: https://eudml.org/doc/46131
review text: 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.
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 3983185
zbMATH Keywords: packing
zbMATH Keywords: covering
zbMATH Keywords: decomposition
zbMATH Keywords: forests
author: Yehuda Roditty
MaRDI profile type: Publication
OpenAlex ID: W2077115265
description: scientific article; zbMATH DE number 3983185