Graph Minors. XXII. Irrelevant vertices in linkage problems

Journal of Combinatorial Theory. Series B

Volumn 102, Issue 2, 2012, Pages 530-563

  Robertson, Neil ^a   Seymour, Paul ^b  

^a OHIO STATE UNIVERSITY   (United States)

^b PRINCETON UNIVERSITY   (United States)

Author keywords

Disjoint paths algorithm; Graph minors; Irrelevant vertex; Linkage problem

Indexed keywords

EID: 84856732037     PISSN: 00958956     EISSN: 10960902     Source Type: Journal    
DOI: 10.1016/j.jctb.2007.12.007     Document Type: Article

References (8)

1. Robertson N., Seymour P.D. Graph minors. VI. Disjoint paths across a disc. J. Combin. Theory Ser. B 1986, 41:115-138.
2. Robertson N., Seymour P.D. Graph minors. VII. Disjoint paths on a surface. J. Combin. Theory Ser. B 1988, 45:212-254.
3. Robertson N., Seymour P.D. Graph minors. X. Obstructions to tree-decomposition. J. Combin. Theory Ser. B 1991, 52:153-190.
4. Robertson N., Seymour P.D. Graph minors. XII. Distance on a surface. J. Combin. Theory Ser. B 1995, 64:240-272.
5. Robertson N., Seymour P.D. Graph minors. XIII. The disjoint paths problem. J. Combin. Theory Ser. B 1995, 63:65-110.
6. Robertson N., Seymour P.D. Graph minors. XIV. Extending an embedding. J. Combin. Theory Ser. B 1995, 65:23-50.
7. Robertson N., Seymour P.D. Graph minors. XXI. Graphs with unique linkages. J. Combin. Theory Ser. B 2009, 99:583-616.
8. Seymour P.D., Thomas R. Graph searching, and a min-max theorem for tree-width. J. Combin. Theory Ser. B 1993, 58:22-33.