Constructions of optimal packing and covering of the complete multigraph with applications
From MaRDI portal
Publication:3400280
Recommendations
- Six-vertex graph packings and coverings of \(\lambda K_v\)
- Packings and coverings for four graphs with six vertices and nine edges \((\lambda>1)\)
- scientific article; zbMATH DE number 1998284
- Packings and coverings for four particular graphs each with six vertices and nine edges \((\lambda =1)\).
- Packings and coverings of \(\lambda K_v\) by the graphs with seven points, seven edges and one 5-circle.
Cites work
- scientific article; zbMATH DE number 17515 (Why is no real title available?)
- scientific article; zbMATH DE number 867473 (Why is no real title available?)
- Covering graphs: The covering problem solved
- Coverings of a complete graph with five-vertex and five-edge graphs
- Existence of holey LSSOM of type \(2^n\) with application to \(G_7\)-packings of \(K_v\)
- Nested optimal \(\lambda\)-packings and \(\lambda\)-coverings of pairs with triples
- On Kirkman packing designs KPD\((\{3,4\},v)\).
- On covering designs with block size 5 and index 5
- On linear combinatorics. II: Structure theorems via additive number theory
- On the covering of pairs by quadruples. I
- On the covering of pairs by quadruples. II
- Packing of \(K_{v}\) with certain graphs of five vertices
- Resolvable group divisible designs with block size 3
- The Doyen-Wilson theorem for maximum packings of \(K_n\) with 4-cycles
- Traffic Grooming in Unidirectional Wavelength-Division Multiplexed Rings with Grooming RatioC= 6
- \(G\)-decomposition of \(K_n\), where G has four vertices or less
Cited in
(12)- Packings and perfect path double covers of maximal planar graphs
- scientific article; zbMATH DE number 1910787 (Why is no real title available?)
- Maximum \(2\times 3\) grid-block packings of \(K_v\)
- Packings and coverings of the complete directed multigraph with 3- and 4-circuits
- scientific article; zbMATH DE number 2114468 (Why is no real title available?)
- Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
- Maximum packings of \(K_v\) with copies of \(P_3\) which contain no proper subsystems
- scientific article; zbMATH DE number 1156643 (Why is no real title available?)
- Graph divisible designs and packing constructions
- Covering and packing in graphs. V. Mispacking subcubes in hypercubes
- scientific article; zbMATH DE number 2195337 (Why is no real title available?)
- Optimal packings and coverings of complete multigraph \(\lambda {K_v}\) with four kinds of graphs
This page was built for publication: Constructions of optimal packing and covering of the complete multigraph with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3400280)
