Graph Minors. XXII. Irrelevant vertices in linkage problems

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.

[1]  Paul D. Seymour,et al.  Graph minors. VII. Disjoint paths on a surface , 1988, J. Comb. Theory, Ser. B.

[2]  Paul D. Seymour,et al.  Graph minors. VI. Disjoint paths across a disc , 1986, J. Comb. Theory, Ser. B.

[3]  Paul D. Seymour,et al.  Graph Minors: XV. Giant Steps , 1996, J. Comb. Theory, Ser. B.

[4]  Paul D. Seymour,et al.  Graph minors. XXI. Graphs with unique linkages , 2009, J. Comb. Theory, Ser. B.

[5]  Paul D. Seymour,et al.  Graph Minors .XII. Distance on a Surface , 1995, J. Comb. Theory, Ser. B.

[6]  Paul D. Seymour,et al.  Graph minors. X. Obstructions to tree-decomposition , 1991, J. Comb. Theory, Ser. B.

[7]  Robin Thomas,et al.  Graph Searching and a Min-Max Theorem for Tree-Width , 1993, J. Comb. Theory, Ser. B.

[8]  Paul D. Seymour,et al.  Graph Minors .XIV. Extending an Embedding , 1995, J. Comb. Theory, Ser. B.

[9]  Richard Krueger.  Graph searching , 2005 .

[10]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.