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

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

Neil Robertson, P. D. Seymour

Publication date: 15 October 2003

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

Mathematics Subject Classification ID

05C05: Trees

05C65: Hypergraphs

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C83: Graph minors

Related Items

The structure of \(TK_ a\)-free graphs, The complexity of induced minors and related problems