Graph Minors. XXII. Irrelevant vertices in linkage problems

Authors:
Neil Robertson;Paul Seymour
Affiliations:
Ohio State University, Columbus, OH 43210, United States;Princeton University, Princeton, NJ 08544, United States
Venue:
Journal of Combinatorial Theory Series B
Year:
2012

Citing 8
Cited 8

Graph minors. VI. Disjoint paths across a disc

Journal of Combinatorial Theory Series B
Graph minors. VII. Disjoint paths on a surface

Journal of Combinatorial Theory Series B
Graph minors: X. obstructions to tree-decomposition

Journal of Combinatorial Theory Series B
Graph searching and a min-max theorem for tree-width

Journal of Combinatorial Theory Series B
Graph minors. XIII: the disjoint paths problem

Journal of Combinatorial Theory Series B
Graph minors XIV: extending an embedding

Journal of Combinatorial Theory Series B
Graph minors. XII: distance on a surface

Journal of Combinatorial Theory Series B
Graph minors. XXI. Graphs with unique linkages

Journal of Combinatorial Theory Series B

A shorter proof of the graph minor algorithm: the unique linkage theorem

Proceedings of the forty-second ACM symposium on Theory of computing
Odd cycle packing

Proceedings of the forty-second ACM symposium on Theory of computing
Tight bounds for linkages in planar graphs

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Erdös-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem

Journal of Combinatorial Theory Series B
Obtaining planarity by contracting few edges

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Obtaining planarity by contracting few edges

Theoretical Computer Science
Effective computation of immersion obstructions for unions of graph classes

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the algorithm for the disjoint paths problem given in Graph Minors XIII, we used without proof a lemma that, in solving such a problem, a vertex which was sufficiently ''insulated'' from the rest of the graph by a large planar piece of the graph was irrelevant, and could be deleted without changing the problem. In this paper we prove the lemma.