The following pages link to Disjoint \(A\)-paths in digraphs (Q2565693):
Displaying 16 items.
- Packing cycles with modularity constraints (Q653988) (← links)
- Path-closed sets (Q802569) (← links)
- Packing non-zero \(A\)-paths in an undirected model of group labeled graphs (Q965242) (← links)
- Disjoint paths in symmetric digraphs (Q1003758) (← links)
- Disjoint directed and undirected paths and cycles in digraphs (Q1034635) (← links)
- Disjoint paths in acyclic digraphs (Q1325242) (← links)
- Disjoint paths in graphs. III: Characterization (Q1407501) (← links)
- Disjoint non-balanced \(A\)-paths in biased graphs (Q2020032) (← links)
- Packing \(A\)-paths of length zero modulo four (Q2237857) (← links)
- Disjoint path covers joining prescribed source and sink sets in interval graphs (Q2419125) (← links)
- Disjoint sub(di)graphs in digraphs (Q2851460) (← links)
- Arc-disjoint paths in decomposable digraphs (Q2922218) (← links)
- Vertex-disjoint paths and edge-disjoint branchings in directed graphs (Q3797196) (← links)
- Frames, $A$-Paths, and the Erdös--Pósa Property (Q4564886) (← links)
- An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem (Q5259540) (← links)
- On the complexity of finding internally vertex-disjoint long directed paths (Q5918120) (← links)
