Packing of K_v with certain graphs of five vertices

DOI10.1016/S0378-3758(02)00224-0zbMATH Open1002.05055MaRDI QIDQ698025FDOQ698025

Authors: Shucheng Zhang, Jianxing Yin 

Publication date: 18 September 2002

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Recommendations

• A note to maximum packings of \(K_v\) with a graph \(G\) of five vertices and five edges
• scientific article; zbMATH DE number 1153448
• The packing and covering of the complete graph. I: The forests of order five
• scientific article; zbMATH DE number 731858
• scientific article; zbMATH DE number 2114468

zbMATH Keywords

complete graphpacking number\(G\)-packing

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Constructions of optimal packing designs
• Graph-theoretic parameters concerning domination, independence, and irredundance
• 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
• Packing and Covering of the Complete Graph with 4-Cycles^*
• Optimal packings of \(K_4\)'s into a \(K_n\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Packing pairs by quintuples: The case of zero congruence mod 4
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (13)

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)