Pages that link to "Item:Q5110654"
From MaRDI portal
The following pages link to On packing spanning arborescences with matroid constraint (Q5110654):
Displaying 9 items.
- Two packing problems on \(k\)-matroid trees (Q1178033) (← links)
- On packing spanning arborescences with matroid constraint (Q1689956) (← links)
- A matroid approach to finding edge connectivity and packing arborescences (Q1892220) (← links)
- Independent arborescences in directed graphs (Q1937557) (← links)
- Polymatroid-based capacitated packing of branchings (Q2334055) (← links)
- On the complexity of packing rainbow spanning trees (Q2685331) (← links)
- On maximal independent arborescence packing (Q2832576) (← links)
- Matroid-Based Packing of Arborescences (Q5300512) (← links)
- Matroid-rooted packing of arborescences (Q6646737) (← links)