The packing and covering of the complete graph I: the forests of order five

Y. Roditty

International Journal of Mathematics and Mathematical Sciences, 1986, vol. 9, 1-6

Abstract:

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.

Date: 1986
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/9/607502.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/9/607502.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:607502

DOI: 10.1155/S0161171286000340

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().