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 Kn, and the minimum number of forests of order five whose union is Kn, are determined.

Bibliographic Details
Main Author: Y. Roditty
Format: Article
Language:English
Published: Hindawi Limited 1986-01-01
Series:International Journal of Mathematics and Mathematical Sciences
Subjects:
Online Access:http://dx.doi.org/10.1155/S0161171286000340
id doaj-18e77583f5b345cc8a9414dd6d488ad6
record_format Article
spelling doaj-18e77583f5b345cc8a9414dd6d488ad62020-11-24T23:38:40ZengHindawi LimitedInternational Journal of Mathematics and Mathematical Sciences0161-17121687-04251986-01-019227728210.1155/S0161171286000340The packing and covering of the complete graph I: the forests of order fiveY. Roditty0School of Mathematical Sciences, Tel-Aviv University, Tel-Aviv, IsraelThe maximum number of pairwise edge disjoint forests of order five in the complete graph Kn, and the minimum number of forests of order five whose union is Kn, are determined.http://dx.doi.org/10.1155/S0161171286000340packingcoveringdecomposition.
collection DOAJ
language English
format Article
sources DOAJ
author Y. Roditty
spellingShingle Y. Roditty
The packing and covering of the complete graph I: the forests of order five
International Journal of Mathematics and Mathematical Sciences
packing
covering
decomposition.
author_facet Y. Roditty
author_sort Y. Roditty
title The packing and covering of the complete graph I: the forests of order five
title_short The packing and covering of the complete graph I: the forests of order five
title_full The packing and covering of the complete graph I: the forests of order five
title_fullStr The packing and covering of the complete graph I: the forests of order five
title_full_unstemmed The packing and covering of the complete graph I: the forests of order five
title_sort packing and covering of the complete graph i: the forests of order five
publisher Hindawi Limited
series International Journal of Mathematics and Mathematical Sciences
issn 0161-1712
1687-0425
publishDate 1986-01-01
description The maximum number of pairwise edge disjoint forests of order five in the complete graph Kn, and the minimum number of forests of order five whose union is Kn, are determined.
topic packing
covering
decomposition.
url http://dx.doi.org/10.1155/S0161171286000340
work_keys_str_mv AT yroditty thepackingandcoveringofthecompletegraphitheforestsoforderfive
AT yroditty packingandcoveringofthecompletegraphitheforestsoforderfive
_version_ 1725516375430004736