scientific article; zbMATH DE number 125473

MaRDI QIDQ4027175zbMATH OpenFDO

Authors Martin Loebl, Svatopluk Poljak

Publication date 21 February 1993

zbMATH Keywords

\(F\)-factor\(F\)-matchingefficient algorithmmin-max theorem

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Packings by cliques and by finite families of graphs
• Efficient subgraphs packing
• Integer and fractional packing of families of graphs
• scientific article; zbMATH DE number 15366
• On the tree packing problem

Cited in

(2)

• About a new class of matroid-inducing packing families
• Approximation algorithms for maximum weight k-coverings of graphs by packings

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