Graph minors. IV: Tree-width and well-quasi-ordering
From MaRDI portal
Publication:2639869
DOI10.1016/0095-8956(90)90120-OzbMath0719.05032MaRDI QIDQ2639869
Publication date: 1990
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
05C10: Planar graphs; geometric and topological aspects of graph theory
Related Items
Graph minors. X: Obstructions to tree-decomposition, A partial k-arboretum of graphs with bounded treewidth, Highly connected sets and the excluded grid theorem, The monadic second order logic of graphs. VI: On several representations of graphs by relational structures, On search, decision, and the efficiency of polynomial-time algorithms, A simpler proof of the excluded minor theorem for higher surfaces, Multiplicities of eigenvalues and tree-width of graphs, Tree-width, path-width, and cutwidth, Improving spanning trees by upgrading nodes, The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues