Pages that link to "Item:Q3930654"

The following pages link to A Polynomial Solution to the Undirected Two Paths Problem (Q3930654):

Displaying 50 items.

• Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← 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)
• Bonds with parity constraints (Q414634) (← links)
• On the complexity of the edge-disjoint min-min problem in planar digraphs (Q428855) (← links)
• On shortest disjoint paths in planar graphs (Q429668) (← 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)
• A simpler proof for the two disjoint odd cycles theorem (Q744153) (← 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)
• Efficient reduction for path problems on circular-arc graphs (Q802884) (← links)
• Finding disjoint paths with related path costs (Q857785) (← links)
• Some recent progress and applications in graph minor theory (Q878052) (← links)
• A simple solution to the two paths problem in planar graphs (Q917331) (← 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)
• A polynomial-time algorithm to find a linkless embedding of a graph (Q1003855) (← links)
• Structure and recognition of graphs with no 6-wheel subdivision (Q1031873) (← links)
• An approach to the subgraph homeomorphism problem (Q1062457) (← links)
• On orientations and shortest paths (Q1123899) (← links)
• 2-linked graphs (Q1150633) (← links)
• Symmetric space-bounded computation (Q1167537) (← 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)
• The \(\gamma\)-connected assignment problem (Q1307813) (← links)
• Hadwiger's conjecture for \(K_ 6\)-free graphs (Q1311018) (← links)
• On the Euclidean two paths problem (Q1315995) (← links)
• Rooted routing in the plane (Q1346696) (← links)
• The complexity of induced minors and related problems (Q1346772) (← links)
• Projective plan and Möbius band obstructions (Q1385984) (← links)
• The disjoint shortest paths problem (Q1392552) (← links)
• Theory of uncontrollable flows -- a new type of network-flow theory as a model for the 21st century of multiple values (Q1608406) (← links)
• An improved linear edge bound for graph linkages (Q1767622) (← links)
• Graph minors. IX: Disjoint crossed paths (Q1813957) (← links)
• Linear time algorithms for two disjoint paths problems on directed acyclic graphs (Q1929240) (← links)
• The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649) (← links)
• Rooted topological minors on four vertices (Q2099413) (← links)
• Characterization of \((m, n)\)-linked planar graphs (Q2160994) (← links)
• Finding a path with two labels forbidden in group-labeled graphs (Q2173429) (← links)
• On finding maximum disjoint paths with different colors: computational complexity and practical LP-based algorithms (Q2232599) (← links)
• A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs (Q2268855) (← links)