Packing of \(K_{v}\) with certain graphs of five vertices
From MaRDI portal
Publication:698025
DOI10.1016/S0378-3758(02)00224-0zbMath1002.05055MaRDI QIDQ698025
Publication date: 18 September 2002
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Related Items (5)
Coverings of a complete graph with five-vertex and five-edge graphs ⋮ Unnamed Item ⋮ The decomposition of \(K_v\) into \(K_2\times K_5\)'s ⋮ On the existence of maximum resolvable (\(K_{4} - e\))-packings ⋮ Constructions of optimal packing and covering of the complete multigraph with applications
Cites Work
- Packing and covering of the complete graph with a graph G of four vertices or less
- The packing and covering of the complete graph. I: The forests of order five
- Optimal packings of \(K_4\)'s into a \(K_n\)
- Packing pairs by quintuples: The case of zero congruence mod 4
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Packing and Covering of the Complete Graph with 4-Cycles*
- Constructions of optimal packing designs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Packing of \(K_{v}\) with certain graphs of five vertices