The following pages link to (Arc-)disjoint flows in networks (Q2437760):
Displayed 6 items.
- The complexity of finding arc-disjoint branching flows (Q298947) (← links)
- On supereulerian 2-edge-coloured graphs (Q2053721) (← links)
- Balanced branchings in digraphs (Q2354769) (← links)
- Acyclic Digraphs (Q3120435) (← links)
- Sufficient Conditions for a Digraph to be Supereulerian (Q5251197) (← links)
- FPT algorithms for packing \(k\)-safe spanning rooted sub(di)graphs (Q6153458) (← links)