scientific article; zbMATH DE number 878334

MaRDI QIDQ4877597zbMATH OpenFDO

Authors Zsolt Tuza, Salvatore Milici

Publication date 18 August 1996

zbMATH Keywords

non-existence resultstriple systemsdesign theoryreduction theorems\(F\)-coverable graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of packing and covering (05B40) Triple systems (05B07)

Recommendations

• \(P_{3}\)-equicoverable graphs-research on \(H\)-equicoverable graphs
• scientific article; zbMATH DE number 4154489
• Criterion for a type of \((g,f)\)-3-covered graphs
• Publication:4731215
• scientific article; zbMATH DE number 4075125

Cited in

(9)

• Covering graphs: The covering problem solved
• On cover-structure graphs
• Induced decompositions of highly dense graphs
• Covering step graph
• Covering arrays on graphs
• The covering chain of a graph
• The spectrum of \(\lambda\)-times repeated blocks for \(\text{TS}(v,\lambda)\)
• Three ways to cover a graph
• The expected relative error of the polyhedral approximation of the max- cut problem

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 Q4877597)