Pages that link to "Item:Q2570121"
From MaRDI portal
The following pages link to On partitioning two matroids into common independent subsets (Q2570121):
Displaying 6 items.
- Partitioning the edge set of a bipartite graph into chain packings: Complexity of some variations (Q1399253) (← links)
- Complexity of packing common bases in matroids (Q2039228) (← links)
- The \(b\)-branching problem in digraphs (Q2192110) (← links)
- Fair representation in the intersection of two matroids (Q2409842) (← links)
- A generalized-polymatroid approach to disjoint common independent sets in two matroids (Q2421866) (← links)
- Partitioning into common independent sets via relaxing strongly base orderability (Q6144384) (← links)