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.
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
1986-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S0161171286000340 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832545627459813376 |
|---|---|
| author | Y. Roditty |
| author_facet | Y. Roditty |
| author_sort | Y. Roditty |
| collection | DOAJ |
| 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. |
| format | Article |
| id | doaj-art-18e77583f5b345cc8a9414dd6d488ad6 |
| institution | Kabale University |
| issn | 0161-1712 1687-0425 |
| language | English |
| publishDate | 1986-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Mathematics and Mathematical Sciences |
| spelling | doaj-art-18e77583f5b345cc8a9414dd6d488ad62025-02-03T07:25:12ZengWileyInternational 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. |
| 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. |
| title | 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_short | 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 |
| topic | packing covering decomposition. |
| url | http://dx.doi.org/10.1155/S0161171286000340 |
| work_keys_str_mv | AT yroditty thepackingandcoveringofthecompletegraphitheforestsoforderfive AT yroditty packingandcoveringofthecompletegraphitheforestsoforderfive |