Covering graphs: The covering problem solved

DOI10.1006/jcta.1998.2867zbMath0913.05078OpenAlexW2037199003MaRDI QIDQ1269896

Raphael Yuster, Yair Caro

Publication date: 8 June 1999

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a3713b8cb2e24397f85719fbad7902439984013a

zbMATH Keywords

covering

Mathematics Subject Classification ID

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

Related Items (9)

Unnamed Item ⋮ Packing cliques in 3‐uniform hypergraphs ⋮ Packings and coverings of \(\lambda K_{v}\) by \(k\)-circuits with one chord. ⋮ Generalising Fisher's inequality to coverings and packings ⋮ Constructions and bounds for separating hash families ⋮ Orthogonal decomposition and packing of complete graphs ⋮ Constructions of optimal packing and covering of the complete multigraph with applications ⋮ Packing and decomposition of graphs with trees ⋮ Group Divisible Covering Designs with Block Size 4: A Type of Covering Array with Row Limit

Cites Work

• Minimal coverings of pairs by triples
• Packing and covering of the complete graph with a graph G of four vertices or less
• Balanced incomplete block designs and related designs
• Packing graphs: The packing problem solved
• Matchings and covers in hypergraphs
• On coverings
• On the covering of pairs by quadruples. I
• On the covering of pairs by quadruples. II
• Packing and Covering of the Complete Graph with 4-Cycles^*
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Covering graphs: The covering problem solved