Recommendations
Cites work
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 3720956 (Why is no real title available?)
- scientific article; zbMATH DE number 3534506 (Why is no real title available?)
- scientific article; zbMATH DE number 3557552 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- scientific article; zbMATH DE number 3195967 (Why is no real title available?)
- An extension of Tutte's 1-factor theorem
- An extension of matching theory
- Integer and Fractional Matchings
- On certain classes of fractional matchings
- On factors with given components
- On the Complexity of General Graph Factor Problems
- Packing subgraphs in a graph
- Packings by Complete Bipartite Graphs
- Packings by cliques and by finite families of graphs
- Paths, Trees, and Flowers
- Transversals and matroid partition
Cited in
(15)- Strong algorithms for the ordinal matroid secretary problem
- scientific article; zbMATH DE number 3954941 (Why is no real title available?)
- Optimal packing of induced stars in a graph
- Matroids Induced by Packing Subgraphs
- Good characterizations for some degree constrained subgraphs
- Families of matroids induced by classes of graphs
- Induced graph packing problems
- The superstar packing problem
- About a new class of matroid-inducing packing families
- scientific article; zbMATH DE number 3150 (Why is no real title available?)
- The nonnegative node weight \(j\)-restricted \(k\)-matching problems
- An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem
- On packing minors into connected matroids
- Gadget classification
- Packing $k$-Matchings and $k$-Critical Graphs
This page was built for publication: On matroids induced by packing subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109053)
