Constructions of optimal packing and covering of the complete multigraph with applications

DOI10.1080/09720529.2009.10698244zbMath1180.05084OpenAlexW2038277000MaRDI QIDQ3400280

Zhile Liang, Jian Yong Wang

Publication date: 5 February 2010

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2009.10698244

zbMATH Keywords

\(G\)-design\(G\)-packing\(G\)-covering\(K_3(2)\)

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Packing of \(K_{v}\) with certain graphs of five vertices
• Resolvable group divisible designs with block size 3
• \(G\)-decomposition of \(K_n\), where G has four vertices or less
• Covering graphs: The covering problem solved
• Nested optimal \(\lambda\)-packings and \(\lambda\)-coverings of pairs with triples
• On linear combinatorics. II: Structure theorems via additive number theory
• On covering designs with block size 5 and index 5
• The Doyen-Wilson theorem for maximum packings of \(K_n\) with 4-cycles
• On Kirkman packing designs KPD\((\{3,4\},v)\).
• Coverings of a complete graph with five-vertex and five-edge graphs
• On the covering of pairs by quadruples. I
• On the covering of pairs by quadruples. II
• Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming RatioC= 6
• Existence of holey LSSOM of type \(2^n\) with application to \(G_7\)-packings of \(K_v\)

This page was built for publication: Constructions of optimal packing and covering of the complete multigraph with applications