Efficient subgraphs packing

DOI10.1006/jctb.1993.1058zbMath0794.05105OpenAlexW2020723104MaRDI QIDQ1321999

Martin Loebl, Svatopluk Poljak

Publication date: 28 August 1994

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1993.1058

zbMATH Keywords

matchingpacking

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (18)

About a new class of matroid-inducing packing families ⋮ Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles ⋮ The superstar packing problem ⋮ Unnamed Item ⋮ Optimal packing of induced stars in a graph ⋮ Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem ⋮ Induced graph packing problems ⋮ Edge decompositions and rooted packings of graphs ⋮ Packing 3-vertex paths in claw-free graphs and related topics ⋮ Packing $k$-Matchings and $k$-Critical Graphs ⋮ Matchings of cycles and paths in directed graphs ⋮ The existence of a path-factor without small odd paths ⋮ Oriented star packings ⋮ On the complexity of digraph packings ⋮ The Nonnegative Node Weight j-Restricted k-Matching Problems ⋮ Edge decompositions into two kinds of graphs ⋮ Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure ⋮ Independent packings in structured graphs

This page was built for publication: Efficient subgraphs packing