scientific article; zbMATH DE number 4148138

MaRDI QIDQ3478438zbMATH OpenFDO

Authors Martin Loebl, Svatopluk Poljak

Publication date 1988

zbMATH Keywords

complexitycomputationalbipartite H-packing problem

Mathematics Subject Classification ID

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

Recommendations

• Packings by Complete Bipartite Graphs
• Packing problems in edge-colored graphs
• Packing bipartite graphs with covers of complete bipartite graphs
• Packings by cliques and by finite families of graphs
• Packing bipartite graphs with covers of complete bipartite graphs

Cited in

(11)

• Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations
• Bipartite bihypergraphs: a survey and new results
• Packing bipartite graphs with covers of complete bipartite graphs
• Packings by Complete Bipartite Graphs
• scientific article; zbMATH DE number 4162902 (Why is no real title available?)
• A note on \({\mathtt V}\)-free 2-matchings
• Partitioning the edge set of a bipartite graph into the minimal number of subgraphs isomorphic to those of a simple 4 order cycle
• Packing bipartite graphs with covers of complete bipartite graphs
• Bipacking a bipartite graph with girth at least 12
• Completing partial packings of bipartite graphs
• Gadget classification

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