The following pages link to (Q4070624):
Displaying 9 items.
- Immersing complete digraphs (Q427820) (← links)
- Equivalence between the minimum covering problem and the maximum matching problem (Q1068107) (← links)
- Discrete extremal problems (Q1152306) (← 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)
- Edge-disjoint branchings in temporal digraphs (Q2236804) (← links)
- Integer programming duality: Price functions and sensitivity analysis (Q3908768) (← links)
- FPT algorithms for packing \(k\)-safe spanning rooted sub(di)graphs (Q6153458) (← links)