Graph minors. XVIII: Tree-decompositions and well-quasi-ordering

DOI10.1016/S0095-8956(03)00067-4zbMath1023.05111MaRDI QIDQ1410732

P. D. Seymour, Neil Robertson

Publication date: 15 October 2003

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Mathematics Subject Classification ID

Trees (05C05) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83)

Related Items

The complexity of induced minors and related problems, Fixed-Parameter Tractability of Treewidth and Pathwidth, Simplicial tree-decompositions of infinite graphs. I, String graphs. II: Recognizing string graphs is NP-hard, The power of cut-based parameters for computing edge-disjoint paths, String graphs. I: The number of critical nonstring graphs is infinite, Some recent progress and applications in graph minor theory, On well-quasi-ordering finite structures with labels, Graph minors. XIX: Well-quasi-ordering on a surface., Upper Bounds on the Graph Minor Theorem, The structure of \(TK_ a\)-free graphs, Graph minors XXIII. Nash-Williams' immersion conjecture, Graph minors. XX: Wagner's conjecture, Graph minor theory, A Linear-Time Parameterized Algorithm for Node Unique Label Cover, THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS

Cites Work

• Graph minors. X: Obstructions to tree-decomposition
• Graph minors. IV: Tree-width and well-quasi-ordering
• Unnamed Item