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)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
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*
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item