Pages that link to "Item:Q1850551"
From MaRDI portal
The following pages link to A short proof of Mader's \(\mathcal S\)-paths theorem (Q1850551):
Displaying 15 items.
- Tree metrics and edge-disjoint \(S\)-paths (Q463719) (← links)
- Packing non-zero \(A\)-paths in an undirected model of group labeled graphs (Q965242) (← links)
- A randomized polynomial kernel for subset feedback vertex set (Q1702849) (← links)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
- Disjoint non-balanced \(A\)-paths in biased graphs (Q2020032) (← links)
- A fast algorithm for the path 2-packing problem (Q2268342) (← links)
- Recent techniques and results on the Erdős-Pósa property (Q2403789) (← links)
- Disjoint \(A\)-paths in digraphs (Q2565693) (← links)
- Optimal connectivity for fat-triangle linkages (Q2689492) (← links)
- Euler Digraphs (Q3120436) (← links)
- Packings and 2-packings of A-paths (Q3439371) (← links)
- Disjoint<i>T</i>-paths in tough graphs (Q3528155) (← links)
- Frames, $A$-Paths, and the Erdös--Pósa Property (Q4564886) (← links)
- On the complexity of finding internally vertex-disjoint long directed paths (Q5918120) (← links)
- Finding Maximum Edge-Disjoint Paths Between Multiple Terminals (Q6057790) (← links)
