Matroids Induced by Packing Subgraphs
From MaRDI portal
Publication:5317567
DOI10.1137/S0895480102379830zbMath1069.05060OpenAlexW1996482242MaRDI QIDQ5317567
Publication date: 16 September 2005
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0895480102379830
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (4)
About a new class of matroid-inducing packing families ⋮ Packing $k$-Matchings and $k$-Critical Graphs ⋮ The Nonnegative Node Weight j-Restricted k-Matching Problems ⋮ Strong Algorithms for the Ordinal Matroid Secretary Problem
This page was built for publication: Matroids Induced by Packing Subgraphs
