scientific article; zbMATH DE number 1792588

MaRDI QIDQ4552171zbMATH OpenFDO

Authors Yair Caro, J. Schönheim, Yehuda Roditty

Publication date 29 August 2002

zbMATH Keywords

covering numberpacking number

Mathematics Subject Classification ID

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

Recommendations

• Efficient covering designs of the complete graph
• Covering the edges of a graph by a prescribed tree with minimum overlap
• scientific article; zbMATH DE number 1123811
• Covering graphs: The covering problem solved
• scientific article; zbMATH DE number 426361

Cited in

(10)

• Single change covering designs
• Covering graphs: The covering problem solved
• Efficient covering designs of the complete graph
• Covering the edges of a graph by a prescribed tree with minimum overlap
• Coverings of a complete graph with five-vertex and five-edge graphs
• Overlap number of graphs
• scientific article; zbMATH DE number 4132175 (Why is no real title available?)
• scientific article; zbMATH DE number 426361 (Why is no real title available?)
• scientific article; zbMATH DE number 800291 (Why is no real title available?)
• Restricted and unrestricted hexagon coverings of the complete bipartite graph

This page was built for publication:

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