Graph minors. XVI. Excluding a non-planar graph

被引：200

作者：

Robertson, N ^{[1
]}

Seymour, PD

机构：

[1] Ohio State Univ, Columbus, OH 43210 USA

[2] Telcordia Technol, Morristown, NJ 07960 USA

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES B | 2003年 / 89卷 / 01期

关键词：

D O I：

10.1016/S0095-8956(03)00042-X

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

This paper contains the cornerstone theorem of the series. We study the structure of graphs with no minor isomorphic to a fixed graph L, when L is non-planar. (The case when L is planar was studied in an earlier paper.) We find that every graph with no minor isomorphic to L may be constructed by piecing together in a tree-structure graphs each of which "almost" embeds in some surface in which L cannot be embedded. (C) 2003 Elsevier Science (USA). All rights reserved.

引用

页码：43 / 76

页数：34

共 12 条

[1]

Dirac G. A., 1952, J. London Math. Soc., V27, P85

[2] TOPOLOGY OF SERIES-PARALLEL NETWORKS [J].