论文信息 - Graph minors. VIII. A kuratowski theorem for general surfaces

Graph minors. VIII. A kuratowski theorem for general surfaces

Abstract We prove that for any infinite set of graphs of bounded genus, some member of the set is isomorphic to a minor of another. As a consequence, for any surface Σ there is a finite list of graphs, such that a general graph may be drawn in Σ if an only if it topologically contains none of the graphs in the list.

Paul D. Seymour | Neil Robertson | P. Seymour | N. Robertson

[1] Graham Higman,et al. Ordering by Divisibility in Abstract Algebras , 1952 .

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

[3] Henry H. Glover,et al. 103 Graphs that are irreducible for the projective plane , 1979, J. Comb. Theory, Ser. B.

[4] Paul D. Seymour,et al. Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory B.

[5] Paul D. Seymour,et al. Graph minors. III. Planar tree-width , 1984, J. Comb. Theory B.

[6] Dan Archdeacon,et al. A Kuratowski theorem for nonorientable surfaces , 1989, J. Comb. Theory, Ser. B.

[7] J. Kruskal. Well-quasi-ordering, the Tree Theorem, and Vazsonyi’s conjecture , 1960 .

[8] Dan Archdeacon,et al. A Kuratowski theorem for the projective plane , 1981, J. Graph Theory.

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

[10] C. Kuratowski. Sur le problème des courbes gauches en Topologie , 1930 .

[11] Paul D. Seymour,et al. Graph minors. IV. Tree-width and well-quasi-ordering , 1990, J. Comb. Theory, Ser. B.