Branch-width and well-quasi-ordering in matroids and graphs

Journal of Combinatorial Theory. Series B

Volumn 84, Issue 2, 2002, Pages 270-290

  Geelen, James F ^a   Gerards, A M H ^b,c   Whittle, Geoff ^d  

^a UNIVERSITY OF WATERLOO   (Canada)

^b CWI   (Netherlands)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^d VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

Author keywords

Finite; Graphs; Matroids; Minors

Indexed keywords

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

References (9)

1. Two short proofs concerning tree-decompositions
2. Highly connected sets and the excluded grid theorem
3. Well-quasi-ordering, the tree theorem, and Vázsonyi's conjecture
4. On well-quasi-ordering finite trees
5. Graph minors. IV. Tree-width and well-quasi-ordering
6. Graph minors. X. Obstructions to tree-decomposition
7. A Menger-like property of tree-width: The finite case
8. A simpler proof of the excluded minor theorem for higher surfaces
9. Menger's theorem for matroids