scientific article; zbMATH DE number 15366

zbMATH Open0768.05078MaRDI QIDQ3972010FDOQ3972010

Svatopluk Poljak, Martin Loebl

Publication date: 25 June 1992

Title of this publication is not available (Why is that?)

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)

Cited In (12)

• 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
• Maximum 0-1 timed matching on temporal graphs
• Graph factors and factorization: 1985--2003: a survey
• Packing $k$-Matchings and $k$-Critical Graphs
• Title not available (Why is that?)
• Spanning Rigid Subgraph Packing and Sparse Subgraph Covering

   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 👍 👎

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)