Pages that link to "Item:Q2497998"
From MaRDI portal
The following pages link to Disjoint paths in graphs. (Reprint) (Q2497998):
Displaying 21 items.
- On the complexity of the edge-disjoint min-min problem in planar digraphs (Q428855) (← links)
- Paths and edge-connectivity in graphs (Q799691) (← links)
- Disjoint paths in symmetric digraphs (Q1003758) (← links)
- Disjoint edge paths between given vertices of a convex polytope (Q1062071) (← links)
- Disjoint paths in graphs. I: 3-planar graphs and basic obstructions (Q1400805) (← links)
- Disjoint paths in graphs. II: A special case (Q1400806) (← links)
- Disjoint paths in graphs. III: Characterization (Q1407501) (← links)
- Reconstructing edge-disjoint paths. (Q1413914) (← links)
- A short proof of Mader's \(\mathcal S\)-paths theorem (Q1850551) (← links)
- Disjoint non-balanced \(A\)-paths in biased graphs (Q2020032) (← links)
- On finding Min-Min disjoint paths (Q2375950) (← links)
- Disjoint path covers joining prescribed source and sink sets in interval graphs (Q2419125) (← links)
- Disjoint \(A\)-paths in digraphs (Q2565693) (← links)
- Note on Whitney's theorem for \(k\)-connected graphs (Q2713601) (← links)
- Hardness of Finding Two Edge-Disjoint Min-Min Paths in Digraphs (Q3004683) (← links)
- Vertex-disjoint paths and edge-disjoint branchings in directed graphs (Q3797196) (← links)
- Disjoint Paths in a Planar Graph—A General Theorem (Q3989016) (← links)
- Local edge and local node connectivity in regular graphs (Q4439498) (← links)
- A proof of Menger's Theorem by contraction (Q4786792) (← links)
- LATIN 2004: Theoretical Informatics (Q5901632) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902517) (← links)
