Pages that link to "Item:Q412177"

The following pages link to Graph minors. XXII. Irrelevant vertices in linkage problems (Q412177):

Displaying 28 items.

• 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)
• A linear time algorithm for the induced disjoint paths problem in planar graphs (Q414938) (← links)
• Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem (Q444386) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (Q520046) (← links)
• Algorithms for finding an induced cycle in planar graphs (Q653839) (← links)
• Explicit bounds for graph minors (Q723881) (← links)
• Some recent progress and applications in graph minor theory (Q878052) (← links)
• A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
• Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor (Q2284742) (← links)
• A lower bound on the tree-width of graphs with irrelevant vertices (Q2312606) (← links)
• Fixed-parameter tractability for subset feedback set problems with parity constraints (Q2344735) (← links)
• Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
• Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
• Tight Bounds for Linkages in Planar Graphs (Q3012796) (← links)
• The Induced Disjoint Paths Problem (Q3503839) (← links)
• Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
• Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths (Q5042453) (← links)
• Adapting the Directed Grid Theorem into an FPT Algorithm (Q5099098) (← links)
• Embedding graphs in the torus in linear time (Q5101428) (← links)
• Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds (Q5130572) (← links)
• (Q5743513) (← links)
• The Parameterized Complexity of Graph Cyclability (Q5891809) (← 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)