Packing of K_v with certain graphs of five vertices
The packing number \(p(v,G)\) is the maximum number of edge-disjoint subgraphs isomorphic to \(G\) contained in the complete graph \(K_v\). The determination of \(p(v,G)\) has been given when \(G\) is a forest of five vertices by \textit{Y. Roditty} [The packing and covering of the complete graph. I: The forests of order five. Int. J. Math. Math. Sci. 9, 277-282 (1986; Zbl 0608.05028)] and by Ge when \(G\) is a star of five vertices plus one edge [\textit{G. Ge}, Existence of holey LSSOM of type \(2^n\) with application to \(G_7\)-packing of \(K_n\), not yet published]. The paper under review gives the computation of \(p(v,G)\) for the remaining six graphs with five vertices, at most \(6\) edges and minimum degree \(1\). Each of this six graphs satisfies \(\lfloor v(v-1)/2e(G)\rfloor-1\leq p(v,G)\leq \lfloor v(v-1)/2e(G)\rfloor\) for all \(v\geq 5\).
- Constructions of optimal packing designs
- Graph-theoretic parameters concerning domination, independence, and irredundance
- scientific article; zbMATH DE number 3908438 (Why is no real title available?)
- scientific article; zbMATH DE number 3710227 (Why is no real title available?)
- scientific article; zbMATH DE number 3788645 (Why is no real title available?)
- scientific article; zbMATH DE number 25257 (Why is no real title available?)
- scientific article; zbMATH DE number 3487460 (Why is no real title available?)
- scientific article; zbMATH DE number 398955 (Why is no real title available?)
- scientific article; zbMATH DE number 1308953 (Why is no real title available?)
- scientific article; zbMATH DE number 637290 (Why is no real title available?)
- scientific article; zbMATH DE number 3235247 (Why is no real title available?)
- Optimal packings of \(K_4\)'s into a \(K_n\)
- Packing and Covering of the Complete Graph with 4-Cycles*
- Packing and covering of the complete graph with a graph G of four vertices or less
- Packing pairs by quintuples: The case of zero congruence mod 4
- The packing and covering of the complete graph. I: The forests of order five
- The packing and covering of the complete graph. I: The forests of order five
- Packing pentagons into complete graphs: How clumsy can you get?
- Kirkman packing designs KPD\((\{3, 5^*\},v)\)
- Coverings of a complete graph with five-vertex and five-edge graphs
- A \(5k\)-vertex kernel for \(P_2\)-packing
- The decomposition of \(K_v\) into \(K_2\times K_5\)'s
- Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\)
- Constructions of optimal packing and covering of the complete multigraph with applications
- scientific article; zbMATH DE number 17643 (Why is no real title available?)
- scientific article; zbMATH DE number 21753 (Why is no real title available?)
- The optimal drawings of \(K_{5,n}\)
- A note to maximum packings of K_v with a graph G of five vertices and five edges
- Packings and coverings of lambda-fold line graphs of the complete graph with \(k\)-cycles, for \(k=4,6\)
- On the existence of maximum resolvable (\(K_{4} - e\))-packings
This page was built for publication: Packing of \(K_{v}\) with certain graphs of five vertices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q698025)
