Highly Connected Sets and the Excluded Grid Theorem

Journal of Combinatorial Theory. Series B

Volumn 75, Issue 1, 1999, Pages 61-73

  Diestel, Reinhard ^a   Jensen, Tommy R ^a   Gorbunov, Konstantin Yu ^b   Thomassen, Carsten ^c  

^a CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

^b Institute of New Technologies   (Russian Federation)

^c TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001853238     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1998.1862     Document Type: Article

References (9)

1. Diestel R. Graph Theory. Graduate Texts in Mathematics. 173:1997;Springer-Verlag, New York.
2. Gorbunov K. Yu. Structural Properties of Context-Free Grammars. 1998;Moscow State University.
3. Reed B. A. Tree-width and tangles: A new connectivity measure and some applications. Surveys in Combinatorics. 1997;Cambridge Univ. Press. p. 87-162.
4. Robertson N., Seymour P. D. Graph Minors. IV. Tree-width and well-quasi-ordering. J. Combin. Theory Ser. B. 48:1990;227-254.
5. Robertson N., Seymour P. D. Graph Minors. V. Excluding a planar graph. J. Combin. Theory Ser. B. 41:1986;92-114.
6. Robertson N., Seymour P. D. Graph Minors. X. Obstructions to tree-decomposition. J. Combin. Theory Ser. B. 52:1991;153-190.
7. Robertson N., Seymour P. D., Thomas R. Quickly excluding a planar graph. J. Combin. Theory Ser. B. 62:1994;323-348.
8. Thomassen C. A simpler proof of the excluded minor theorem for higher surfaces. J. Combin. Theory Ser. B. 70:1997;306-311.
9. Thomassen C. Embeddings and minors. Graham R. L., Grötschel M., Lovász L. Handbook of Combinatorics. 1996;Elsevier, Amsterdam.