Pages that link to "Item:Q2832576"
From MaRDI portal
The following pages link to On maximal independent arborescence packing (Q2832576):
Displaying 15 items.
- A note on disjoint arborescences (Q532132) (← links)
- On self-complementary cyclic packing of forests (Q1010622) (← links)
- Old and new results on packing arborescences in directed hypergraphs (Q1744239) (← links)
- Independent arborescences in directed graphs (Q1937557) (← links)
- Packing of mixed hyperarborescences with flexible roots via matroid intersection (Q2048562) (← 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)
- On reachability mixed arborescence packing (Q2419578) (← links)
- (Q5005108) (← links)
- On packing spanning arborescences with matroid constraint (Q5110654) (← links)
- Matroid-Based Packing of Arborescences (Q5300512) (← links)
- Packing of spanning mixed arborescences (Q6056788) (← links)