The following pages link to Disjoint paths in sparse graphs (Q967419):
Displaying 10 items.
- Disjoint paths in symmetric digraphs (Q1003758) (← links)
- Disjoint paths in graphs. III: Characterization (Q1407501) (← links)
- Efficient reassembling of three-regular planar graphs (Q2175057) (← links)
- Disjoint path covers joining prescribed source and sink sets in interval graphs (Q2419125) (← links)
- Short disjoint paths in locally connected graphs (Q2464055) (← links)
- Disjoint \(A\)-paths in digraphs (Q2565693) (← links)
- Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs (Q3439308) (← links)
- (Q4949793) (← links)
- An Approximation Algorithm for Fully Planar Edge-Disjoint Paths (Q4986808) (← links)
- CONSTRAINED DISJOINT PATHS IN GEOMETRIC NETWORKS (Q5325617) (← links)