Journal Menu

Abstracting and Indexing
Aims and Scope
Article Processing Charges
Author Guidelines
Bibliographic Information
Contact Information
Editorial Board
Editorial Workflow
Reviewers Acknowledgment
Subscription Information

Abstract
Full-Text PDF
How to Cite this Article

International Journal of Mathematics and Mathematical Sciences 
Volume 9 (1986), Issue 2, Pages 277-282
doi:10.1155/S0161171286000340

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

Y. Roditty

School of Mathematical Sciences, Tel-Aviv University, Tel-Aviv, Israel

Received 15 September 1984

Abstract

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.