The k‐piece packing problem
From MaRDI portal
Publication:5486279
DOI10.1002/jgt.20161zbMath1099.05066OpenAlexW4256731050MaRDI QIDQ5486279
Jácint Szabó, David B. Hartvigsen, Pavol Hell
Publication date: 6 September 2006
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20161
maximum matchinggraph packingTutte-type theoremEdmonds-type alternating forest algorithmsimple \(k\)-matching
Related Items (14)
About a new class of matroid-inducing packing families ⋮ The superstar packing problem ⋮ Unnamed Item ⋮ Packing $k$-Matchings and $k$-Critical Graphs ⋮ Packing paths: recycling saves time ⋮ Illuminating disjoint line segments in the plane ⋮ Faster algorithm for finding maximum 1-restricted simple 2-matchings ⋮ A note on \({\mathtt V}\)-free 2-matchings ⋮ An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem ⋮ Packing trees with constraints on the leaf degree ⋮ Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs ⋮ Packing paths of length at least two ⋮ The Nonnegative Node Weight j-Restricted k-Matching Problems ⋮ Independent packings in structured graphs
Cites Work
This page was built for publication: The k‐piece packing problem
