The following pages link to Disjoint paths in graphs (Q1150632):
Displaying 50 items.
- Edge-disjoint odd cycles in 4-edge-connected graphs (Q273163) (← links)
- Obstructions for two-vertex alternating embeddings of graphs in surfaces (Q326654) (← links)
- Non-planar extensions of subdivisions of planar graphs (Q326819) (← links)
- The structure of graphs not topologically containing the Wagner graph (Q326822) (← links)
- Rooted \(K_4\)-minors (Q396793) (← links)
- The disjoint paths problem in quadratic time (Q412168) (← links)
- Bonds with parity constraints (Q414634) (← links)
- Linkless and flat embeddings in 3-space (Q420569) (← links)
- On shortest disjoint paths in planar graphs (Q429668) (← links)
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem (Q444386) (← links)
- Packing cycles through prescribed vertices under modularity constraints (Q444427) (← links)
- Criticality for multicommodity flows (Q473104) (← links)
- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (Q520046) (← links)
- On finite convexity spaces induced by sets of paths in graphs (Q533760) (← links)
- Three commodity flows in graphs (Q594107) (← links)
- Independent paths and \(K_{5}\)-subdivisions (Q602715) (← links)
- Optimal parallel algorithms for path problems on planar graphs (Q673083) (← links)
- A new proof of the flat wall theorem (Q684127) (← links)
- 4-connected triangulations and 4-orderedness (Q708369) (← links)
- Shortest \((A+B)\)-path packing via hafnian (Q724248) (← links)
- Cycle double covers of infinite planar graphs (Q726631) (← links)
- A simpler proof for the two disjoint odd cycles theorem (Q744153) (← links)
- Inseparability graphs of oriented matroids (Q750448) (← links)
- Bounds on path connectivity (Q761468) (← links)
- The Kelmans-Seymour conjecture. I: Special separations (Q777488) (← links)
- The Kelmans-Seymour conjecture. II: 2-vertices in \(K_4^-\) (Q777489) (← links)
- The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\) (Q777490) (← links)
- The Kelmans-Seymour conjecture. IV: A proof (Q777491) (← links)
- On the definability of properties of finite graphs (Q791548) (← links)
- Paths and edge-connectivity in graphs (Q799691) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- The extremal function for 3-linked graphs (Q947723) (← links)
- Links in edge-colored graphs (Q966157) (← links)
- Induced disjoint paths problem in a planar digraph (Q967379) (← links)
- Disjoint paths in symmetric digraphs (Q1003758) (← links)
- Structure and recognition of graphs with no 6-wheel subdivision (Q1031873) (← links)
- Cliques, minors and apex graphs (Q1043579) (← links)
- The 2-linkage problem for acyclic digraphs (Q1057282) (← links)
- An approach to the subgraph homeomorphism problem (Q1062457) (← links)
- Edge-disjoint paths in planar graphs (Q1069956) (← links)
- Adjacency in binary matroids (Q1093647) (← links)
- Paths and edge-connectivity in graphs. III: Six-terminal k paths (Q1101467) (← links)
- On orientations and shortest paths (Q1123899) (← links)
- The reduction of graph families closed under contraction (Q1126283) (← links)
- 2-linked graphs (Q1150633) (← links)
- On obstructions to small face covers in planar graphs (Q1204479) (← links)
- General vertex disjoint paths in series-parallel graphs (Q1208474) (← links)
- A linear algorithm for the all-bidirectional-edges problem on planar graphs (Q1209732) (← links)
- Hadwiger's conjecture for \(K_ 6\)-free graphs (Q1311018) (← links)
- Rooted routing in the plane (Q1346696) (← links)
