The packing and covering of the complete graph. I: The forests of order five
From MaRDI portal
Publication:1086247
DOI10.1155/S0161171286000340zbMath0608.05028OpenAlexW2077115265MaRDI QIDQ1086247
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
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (6)
Constructing the spectrum of packings and coverings for the complete graph with stars with up to five edges ⋮ The spectrum of optimal excess graphs for trees with up to four edges ⋮ Packings and coverings of \(\lambda K_{v}\) by \(k\)-circuits with one chord. ⋮ Packing three copies of a tree into its sixth power ⋮ On the existence of maximum resolvable (\(K_{4} - e\))-packings ⋮ Packing of \(K_{v}\) with certain graphs of five vertices
This page was built for publication: The packing and covering of the complete graph. I: The forests of order five
