The Edmonds-Gallai decomposition for the \(k\)-piece packing problem

zbMath1062.05119MaRDI QIDQ1773199

Martin Loebl, Jácint Szabó, Marek Janata

Publication date: 25 April 2005

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/124598

zbMATH Keywords

matchingmatroidbarriergalaxy

Mathematics Subject Classification ID

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

Related Items (5)

Packing $k$-Matchings and $k$-Critical Graphs ⋮ A note on \({\mathtt V}\)-free 2-matchings ⋮ An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem ⋮ Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs ⋮ The Nonnegative Node Weight j-Restricted k-Matching Problems

This page was built for publication: The Edmonds-Gallai decomposition for the \(k\)-piece packing problem