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

DOI10.1155/S0161171286000340MaRDI QIDQ1086247zbMATH OpenOpenAlexFDO

Authors Yehuda Roditty

Publication date 1986

Published in International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/46131

zbMATH Keywords

coveringdecompositionforestspacking

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 1153448
• scientific article; zbMATH DE number 3924794
• A note on packing of three forests
• Packing of \(K_{v}\) with certain graphs of five vertices
• Packings in complete graphs

Cited in

(9)

• Packings and coverings of \(\lambda K_{v}\) by \(k\)-circuits with one chord.
• The spectrum of optimal excess graphs for trees with up to four edges
• Packing three copies of a tree into its sixth power
• Constructing the spectrum of packings and coverings for the complete graph with stars with up to five edges
• scientific article; zbMATH DE number 3924794 (Why is no real title available?)
• scientific article; zbMATH DE number 398941 (Why is no real title available?)
• scientific article; zbMATH DE number 1153448 (Why is no real title available?)
• Packing of \(K_{v}\) with certain graphs of five vertices
• On the existence of maximum resolvable (\(K_{4} - e\))-packings

This page was built for publication: The packing and covering of the complete graph. I: The forests of order five

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1086247)