Graph Minors. XXII. Irrelevant vertices in linkage problems

Author(s): Robertson, Neil; Seymour, Paul D.

Download

To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1p39g

Full metadata record

DC Field	Value	Language
dc.contributor.author	Robertson, Neil	-
dc.contributor.author	Seymour, Paul D.	-
dc.date.accessioned	2018-07-20T15:09:45Z	-
dc.date.available	2018-07-20T15:09:45Z	-
dc.date.issued	2012-03	en_US
dc.identifier.citation	Robertson, Neil, Seymour, Paul. (2012). Graph Minors. XXII. Irrelevant vertices in linkage problems. JOURNAL OF COMBINATORIAL THEORY SERIES B, 102 (530 - 563. doi:10.1016/j.jctb.2007.12.007	en_US
dc.identifier.issn	0095-8956	-
dc.identifier.uri	http://arks.princeton.edu/ark:/88435/pr1p39g	-
dc.description.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. (C) 2011 Elsevier Inc. All rights reserved.	en_US
dc.format.extent	530 - 563	en_US
dc.language.iso	en_US	en_US
dc.relation.ispartof	JOURNAL OF COMBINATORIAL THEORY SERIES B	en_US
dc.rights	Final published version. Article is made available in OAR by the publisher's permission or policy.	en_US
dc.title	Graph Minors. XXII. Irrelevant vertices in linkage problems	en_US
dc.type	Journal Article	en_US
dc.identifier.doi	doi:10.1016/j.jctb.2007.12.007	-
dc.date.eissued	2011-08-09	en_US
pu.type.symplectic	http://www.symplectic.co.uk/publications/atom-terms/1.0/journal-article	en_US

Files in This Item:

File	Description	Size	Format
1-s2.0-S0095895611000724-main.pdf		451.16 kB	Adobe PDF	View/Download