scientific article; zbMATH DE number 15366

MaRDI QIDQ3972010zbMATH OpenFDO

Authors Martin Loebl, Svatopluk Poljak

Publication date 25 June 1992

zbMATH Keywords

factormatchingsmatroidpacking

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

(19)

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

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)