The following pages link to Edge-disjoint paths revisited (Q4962686):
Displaying 16 items.
- Tree metrics and edge-disjoint \(S\)-paths (Q463719) (← links)
- On partitioning the edge set of a graph into internally disjoint paths without exterior vertices (Q659668) (← links)
- Edge-disjoint homotopic paths in a planar graph with one hole (Q1097900) (← links)
- The condition of Beineke and Harary on edge-disjoint paths some of which are openly disjoint (Q1346794) (← links)
- Reconstructing edge-disjoint paths. (Q1413914) (← links)
- On structural parameterizations of the edge disjoint paths problem (Q2032342) (← links)
- Non-shared edges and nearest neighbor interchanges revisited (Q2390296) (← links)
- (Q3615433) (← links)
- Vertex-disjoint paths and edge-disjoint branchings in directed graphs (Q3797196) (← links)
- (Q3999955) (← links)
- (Q4952693) (← links)
- Shortest edge-disjoint paths in graphs (Q5096182) (← links)
- (Q5136255) (← links)
- (Q5688100) (← links)
- Edge Disjoint Paths in Moderately Connected Graphs (Q5893911) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902517) (← links)