Minimum resolvable coverings of K_v with copies of K₄-e

DOI10.1007/S00373-010-1003-0zbMATH Open1233.05046OpenAlexW2786935867MaRDI QIDQ659751FDOQ659751

Lidong Wang, Renwang Su

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-1003-0

zbMATH Keywords

Minimum\((K_{4}-e)\)-coverings\((K_{4}-e)\)-packingsResolvable

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Pair covering designs with block size 5
• Title not available (Why is that?)
• Title not available (Why is that?)
• \(G\)-decomposition of \(K_n\), where G has four vertices or less
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the existence of resolvable K₄ − e designs
• On the existence of maximum resolvable (\(K_{4} - e\))-packings
• Resolvable maximum packings with quadruples
• Simple minimum coverings of \(K_n\) with copies of \(K_4 -e\)
• Title not available (Why is that?)
• Resolvable minimum coverings with quadruples
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some more 5-GDDs and optimal (v), 5, 1)-packings

Cited In (5)

• Equitable resolvable coverings
• Minimum resolvable coverings with small parallel classes
• Title not available (Why is that?)
• Scheduling to reduce close contacts: resolvable grid graph decomposition and packing
• Completing the spectrum for three designs related to the graph \(K_4 - e\)

This page was built for publication: Minimum resolvable coverings of \(K_{v}\) with copies of \(K_{4}-e\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659751)