scientific article; zbMATH DE number 15366

MaRDI QIDQ3972010zbMATH OpenFDO

Authors Martin Loebl, Svatopluk Poljak

Publication date 25 June 1992

zbMATH Keywords

matroidpackingmatchingsfactor

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Graph packings
• Packings by cliques and by finite families of graphs
• Efficient subgraphs packing
• Packings by Complete Bipartite Graphs
• Integer and fractional packing of families of graphs

Cited in

(17)

• scientific article; zbMATH DE number 125473 (Why is no real title available?)
• Spanning Rigid Subgraph Packing and Sparse Subgraph Covering
• Packings by Complete Bipartite Graphs
• On star-packings having a large matching
• Optimal packing of induced stars in a graph
• Good characterizations for some degree constrained subgraphs
• Parameterized and approximation algorithms for the load coloring problem
• About a new class of matroid-inducing packing families
• Packing paths of length at least two
• Packing of graphs - a survey
• Edge-disjoint packings of graphs
• Packings by cliques and by finite families of graphs
• Maximum 0-1 timed matching on temporal graphs
• Graph factors and factorization: 1985--2003: a survey
• Packing \([1, \Delta ]\)-factors in graphs of small degree
• Graph packings
• Packing $k$-Matchings and $k$-Critical Graphs

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