Graph minors. XXII. Irrelevant vertices in linkage problems
From MaRDI portal
Publication:412177
DOI10.1016/J.JCTB.2007.12.007zbMATH Open1239.05173OpenAlexW2046069847MaRDI QIDQ412177FDOQ412177
Authors: Neil Robertson, Paul Seymour 
Publication date: 4 May 2012
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2007.12.007
Recommendations
Cites Work
- Graph minors. X: Obstructions to tree-decomposition
- Graph searching and a min-max theorem for tree-width
- Graph minors. XIII: The disjoint paths problem
- Graph minors. XXI. graphs with unique linkages
- Graph minors. VI. Disjoint paths across a disc
- Graph minors. VII: Disjoint paths on a surface
- Graph minors. XII: Distance on a surface
- Graph minors. XIV: Extending an embedding
Cited In (32)
- Effective computation of immersion obstructions for unions of graph classes
- Hitting minors on bounded treewidth graphs. I: General upper bounds
- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions
- Graph minors and parameterized algorithm design
- Fixed-parameter tractability for subset feedback set problems with parity constraints
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness
- The parameterized complexity of graph cyclability
- A partial k-arboretum of graphs with bounded treewidth
- Explicit bounds for graph minors
- The Induced Disjoint Paths Problem
- Faster parameterized algorithms for modification problems to minor-closed classes
- A more accurate view of the flat wall theorem
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem
- Some recent progress and applications in graph minor theory
- Embedding graphs in the torus in linear time
- Planar disjoint-paths completion
- Adapting the directed grid theorem into an FPT algorithm
- Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor
- Confronting intractability via parameters
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths
- Irrelevant vertices for the planar disjoint paths problem
- Combing a Linkage in an Annulus
- Graph minors. XXI. graphs with unique linkages
- A linear time algorithm for the induced disjoint paths problem in planar graphs
- Erdős-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
- A lower bound on the tree-width of graphs with irrelevant vertices
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion
- Algorithms for finding an induced cycle in planar graphs
- Tight bounds for linkages in planar graphs
- Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm
- Fixed-parameter tractability of treewidth and pathwidth
This page was built for publication: Graph minors. XXII. Irrelevant vertices in linkage problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412177)
