Pages that link to "Item:Q5300512"
From MaRDI portal
The following pages link to Matroid-Based Packing of Arborescences (Q5300512):
Displaying 13 items.
- On packing spanning arborescences with matroid constraint (Q1689956) (← links)
- Old and new results on packing arborescences in directed hypergraphs (Q1744239) (← links)
- Reachability in arborescence packings (Q2166224) (← links)
- Packing of arborescences with matroid constraints via matroid intersection (Q2188242) (← links)
- The \(b\)-branching problem in digraphs (Q2192110) (← links)
- Packing of maximal independent mixed arborescences (Q2217484) (← links)
- Packing branchings under cardinality constraints on their root sets (Q2225417) (← links)
- Polymatroid-based capacitated packing of branchings (Q2334055) (← links)
- Covering Intersecting Bi-set Families under Matroid Constraints (Q2820858) (← links)
- On Maximal Independent Arborescence Packing (Q2832576) (← links)
- (Q5005108) (← links)
- Packing of spanning mixed arborescences (Q6056788) (← links)
- Matroid-rooted packing of arborescences (Q6646737) (← links)
