Pages that link to "Item:Q2875195"

The following pages link to A shorter proof of the graph minor algorithm: the unique linkage theorem (Q2875195):

Displaying 28 items.

• Edge-disjoint odd cycles in 4-edge-connected graphs (Q273163) (← links)
• Planar disjoint-paths completion (Q329285) (← links)
• Irrelevant vertices for the planar disjoint paths problem (Q345131) (← links)
• Effective computation of immersion obstructions for unions of graph classes (Q395009) (← links)
• The disjoint paths problem in quadratic time (Q412168) (← links)
• Linkless and flat embeddings in 3-space (Q420569) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (Q520046) (← links)
• Graph minors. XXI. graphs with unique linkages (Q1026001) (← links)
• Fast minor testing in planar graphs (Q1759679) (← links)
• New algorithms for maximum disjoint paths based on tree-likeness (Q1785205) (← links)
• Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor (Q2284742) (← links)
• Planar Disjoint-Paths Completion (Q2891339) (← links)
• The structure of graphs with a vital linkage of order 2 (Q2911061) (← links)
• Tight Bounds for Linkages in Planar Graphs (Q3012796) (← links)
• Towards the Graph Minor Theorems for Directed Graphs (Q3449461) (← links)
• Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs (Q3452786) (← links)
• Graph Minors I: A Short Proof of the Path-width Theorem (Q4844487) (← links)
• Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
• (Q5091009) (← links)
• Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs (Q5252660) (← links)
• Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs (Q5346553) (← links)
• The Parameterized Complexity of Graph Cyclability (Q5891809) (← links)
• Block elimination distance (Q5918777) (← links)
• \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions (Q6038588) (← links)
• Combing a Linkage in an Annulus (Q6057804) (← links)
• Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm (Q6115414) (← links)
• Faster parameterized algorithms for modification problems to minor-closed classes (Q6601299) (← links)