Packing of K_v with certain graphs of five vertices
From MaRDI portal
Publication:698025
Recommendations
Cites work
- 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?)
- Constructions of optimal packing designs
- Graph-theoretic parameters concerning domination, independence, and irredundance
- 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
Cited in
(13)- scientific article; zbMATH DE number 21753 (Why is no real title available?)
- scientific article; zbMATH DE number 17643 (Why is no real title available?)
- The decomposition of \(K_v\) into \(K_2\times K_5\)'s
- Packings and coverings of lambda-fold line graphs of the complete graph with \(k\)-cycles, for \(k=4,6\)
- Coverings of a complete graph with five-vertex and five-edge graphs
- The optimal drawings of \(K_{5,n}\)
- The packing and covering of the complete graph. I: The forests of order five
- On the existence of maximum resolvable (\(K_{4} - e\))-packings
- A \(5k\)-vertex kernel for \(P_2\)-packing
- Kirkman packing designs KPD\((\{3, 5^*\},v)\)
- Constructions of optimal packing and covering of the complete multigraph with applications
- A note to maximum packings of \(K_v\) with a graph \(G\) of five vertices and five edges
- Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\)
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)