Tree-width of graphs without a 3 x 3 grid minor

被引:3
作者
Birmele, E. [1 ]
Bondy, J. A. [2 ]
Reed, B. A. [3 ]
机构
[1] Univ Evry, INRA 1152, UMR CNRS 8071, Lab Stat & Genome, Evry, France
[2] Univ Lyon 1, Inst Camille Jordan, F-69622 Villeurbanne, France
[3] McGill Univ, Sch Comp Sci, Canada Res Chair Graph Theory, Montreal, PQ H3A 2A7, Canada
关键词
Tree-width; Grid;
D O I
10.1016/j.dam.2008.08.003
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We show that graphs with no minor isomorphic to the 3 x 3 grid have tree-width at most 7. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:2577 / 2596
页数:20
相关论文
共 9 条
[1]   Brambles, prisms and grids [J].
Birmele, E. ;
Bondy, J. A. ;
Reed, B. A. .
GRAPH THEORY IN PARIS: PROCEEDINGS OF A CONFERENCE IN MEMORY OF CALUDE BERGE, 2007, :37-+
[2]   Tree-width and circumference of graphs [J].
Birmele, E .
JOURNAL OF GRAPH THEORY, 2003, 43 (01) :24-25
[3]  
BIRMELE E, 2003, THESIS U LYON, V1
[4]  
BODLAENDER HL, 1988, LECT NOTES COMPUT SC, V317, P105
[5]   THE MONADIC 2ND-ORDER LOGIC OF GRAPHS .3. TREE-DECOMPOSITIONS, MINORS AND COMPLEXITY ISSUES [J].
COURCELLE, B .
RAIRO-INFORMATIQUE THEORIQUE ET APPLICATIONS-THEORETICAL INFORMATICS AND APPLICATIONS, 1992, 26 (03) :257-286
[6]   Highly connected sets and the excluded grid theorem [J].
Diestel, R ;
Jensen, TR ;
Gorbunov, KY ;
Thomassen, C .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1999, 75 (01) :61-73
[7]  
Diestel R, 2017, GRAD TEXT M, V173, DOI 10.1007/978-3-662-53622-3
[8]   APPLICATIONS OF MENGERS GRAPH THEOREM [J].
PERFECT, H .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1968, 22 (01) :96-+
[9]   GRAPH MINORS .5. EXCLUDING A PLANAR GRAPH [J].
ROBERTSON, N ;
SEYMOUR, PD .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1986, 41 (01) :92-114