Pages that link to "Item:Q441857"
From MaRDI portal
The following pages link to Arc-disjoint spanning sub(di)graphs in digraphs (Q441857):
Displaying 14 items.
- Parameterized algorithms for non-separating trees and branchings in digraphs (Q334949) (← links)
- Antistrong digraphs (Q345072) (← links)
- On the tractability of some natural packing, covering and partitioning problems (Q476298) (← links)
- Complexity of some arc-partition problems for digraphs (Q2079880) (← links)
- Non-separating spanning trees and out-branchings in digraphs of independence number 2 (Q2102758) (← links)
- Minimally strong subgraph \((k,\ell ) \)-arc-connected digraphs (Q2151209) (← links)
- (Arc-)disjoint flows in networks (Q2437760) (← links)
- Arc-disjoint paths and trees in 2-regular digraphs (Q2444565) (← links)
- Finding good 2-partitions of digraphs. II. Enumerable properties (Q2629228) (← links)
- The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties (Q2686111) (← links)
- Arc-Disjoint Directed and Undirected Cycles in Digraphs (Q2833257) (← links)
- Good orientations of unions of edge‐disjoint spanning trees (Q6055412) (← links)
- Constrained flows in networks (Q6589851) (← links)
- Strong arc decompositions of split digraphs (Q6642512) (← links)
