QUICKLY EXCLUDING A PLANAR GRAPH

被引：257

作者：

ROBERTSON, N

SEYMOUR, P

THOMAS, R

机构：

[1] BELLCORE,MORRISTOWN,NJ 07960

[2] RUTGERS STATE UNIV,DIMACS CTR,HILL CTR,NEW BRUNSWICK,NJ 08903

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES B | 1994年 / 62卷 / 02期

关键词：

D O I：

10.1006/jctb.1994.1073

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

In an earlier paper, the first two authors proved that for any planar graph H, every graph with no minor isomorphic to H has bounded tree width; but the bound given there was enormous. Here we prove a much better bound. We also improve the best known bound on the tree-width of planar graphs with no minor isomorphic to a g x g grid. (C) 1994 Academic Press, Inc.

引用

页码：323 / 348

页数：26

共 8 条

[1] PLANAR SEPARATORS [J].