05C83 - Graph Minors

maintained by Daniel P. Sanders
as part of www.graphtheory.com
Resources People Research Writings


Graph Minors by Stephen C. Locke

Most 05C83 Article Pages / Authors*

RankPagesAuthor
1 33.00Thilikos, Dimitrios M.
2 31.00Kühn, Daniela
3.5 24.50Robertson, Neil
3.5 24.50Seymour, Paul D.
5 22.50Thomas, Robin
6 21.00Thomason, Andrew
7.5 20.50Oporowski, Bogdan
7.5 20.50Dittmann, John
9 18.50Diestel, Reinhard
11 16.87Fellows, Michael R.
11 16.87Cattell, Kevin
11 16.87Dinneen, Michael J.

 * 05C83 was introduced in MSC 2000

The Graph Minors Series

Neil Robertson and P.D. Seymour; Graph minors. I. Excluding a forest.
J. Combin. Theory Ser. B 35 (1983) 39-61 05C35
Neil Robertson and P.D. Seymour; Graph minors. II. Algorithmic aspects of tree-width.
J. Algorithms 7 (1986) 309-322 05C05 (05C38)
Neil Robertson and P.D. Seymour; Graph minors. III. Planar tree-width.
J. Combin. Theory Ser. B 36 (1984) 49-64 05C70 (05C05)
Neil Robertson and P.D. Seymour; Graph minors. IV. Tree-width and well-quasi-ordering.
J. Combin. Theory Ser. B 48 (1990) 227-254 05C10 (05C05)
Neil Robertson and P.D. Seymour; Graph minors. V. Excluding a planar graph.
J. Combin. Theory Ser. B 41 (1986) 92-114 05C38 (68R10)
Neil Robertson and P.D. Seymour; Graph minors. VI. Disjoint paths across a disc.
J. Combin. Theory Ser. B 41 (1986) 115-138 05C38 (68R10)
Neil Robertson and P.D. Seymour; Graph minors. VII. Disjoint paths on a surface.
J. Combin. Theory Ser. B 45 (1988) 212-254 05C38 (68R10)
Neil Robertson and P.D. Seymour; Graph minors. VIII. A Kuratowski theorem for general surfaces.
J. Combin. Theory Ser. B 48 (1990) 255-288 05C10
Neil Robertson and P.D. Seymour; Graph minors. IX. Disjoint crossed paths.
J. Combin. Theory Ser. B 49 (1990) 40-77 05C10
Neil Robertson and P.D. Seymour; Graph minors. X. Obstructions to tree-decomposition.
J. Combin. Theory Ser. B 52 (1991) 153-190 05C75 (05C10 05C40)
Neil Robertson; Graph minors. XI. Circuits on a surface.
J. Combin. Theory Ser. B 60 (1994) 72-106 05C10 (05C40)
Neil Robertson and P.D. Seymour; Graph minors. XII. Distance on a surface.
J. Combin. Theory Ser. B 64 (1995) 240-272 05C10 (05C12)
Neil Robertson and P.D. Seymour; Graph minors. XIII. The disjoint paths problem.
J. Combin. Theory Ser. B 63 (1995) 65-110 05C38 (05C85)
Neil Robertson and P.D. Seymour; Graph minors. XIV. Extending an embedding.
J. Combin. Theory Ser. B 65 (1995) 23-50 05C10
Neil Robertson and P.D. Seymour; Graph minors. XV. Giant steps.
J. Combin. Theory Ser. B 68 (1996) 112-148 05C10
Neil Robertson and P.D. Seymour; Graph minors. XVI. Excluding a non-planar graph.
J. Combin. Theory Ser. B 89 (2003) 43-76.
Neil Robertson and P.D. Seymour; Graph minors. XVII. Taming a vortex.
J. Combin. Theory Ser. B 77 (1999) 162-210 05C83
Neil Robertson and P.D. Seymour; Graph minors. XVIII. Tree-decompositions and well-quasi-ordering.
J. Combin. Theory Ser. B 89 (2003) 77-108
Neil Robertson and P.D. Seymour; Graph minors. XIX. Well-quasi-ordering on a surface.
J. Combin. Theory Ser. B 90 (2004) 325-385
Dan Bienstock, Neil Robertson, Paul Seymour, and Robin Thomas; Quickly excluding a forest.
J. Combin. Theory Ser. B 52 (1991) 274-283 05C05 (05C75)
Neil Robertson, Paul Seymour, and Robin Thomas; Quickly excluding a planar graph.
J. Combin. Theory Ser. B 62 (1994) 323-348 05C10


© www.graphtheory.com & JLG