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!
|