Matroids Induced by Packing Subgraphs

DOI10.1137/S0895480102379830MaRDI QIDQ5317567zbMATH OpenOpenAlexFDO

Authors Marek Janata

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

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• About a new class of matroid-inducing packing families
• On matroids induced by packing subgraphs
• scientific article; zbMATH DE number 3150
• Induced graph packing problems
• scientific article; zbMATH DE number 67322

Cited in

(10)

• Packing circuits in matroids
• On matroids induced by packing subgraphs
• On packing minors into connected matroids
• About a new class of matroid-inducing packing families
• Families of matroids induced by classes of graphs
• Packing $k$-Matchings and $k$-Critical Graphs
• scientific article; zbMATH DE number 3150 (Why is no real title available?)
• Strong algorithms for the ordinal matroid secretary problem
• The nonnegative node weight \(j\)-restricted \(k\)-matching problems
• A characterization of matroidal families of multigraphs

This page was built for publication: Matroids Induced by Packing Subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317567)