Excluding a countable clique

DOI10.1006/jctb.1998.1886zbMath0935.05083OpenAlexW2060341104MaRDI QIDQ1305523

Robin Thomas, Reinhard Diestel

Publication date: 4 May 2000

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

Full work available at URL: https://semanticscholar.org/paper/fa1f8a02e86497561aee281dd6c432cc9d19408e

zbMATH Keywords

minortree-decomposition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph minors (05C83) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

Forcing a K_r minor by high external connectivity ⋮ Excluding subdivisions of bounded degree graphs ⋮ Some recent progress and applications in graph minor theory ⋮ Ubiquity of graphs with nowhere‐linear end structure ⋮ Partitioning \(H\)-minor free graphs into three subgraphs with no large components

Cites Work

• A compactness theorem for complete separators
• Excluding infinite minors
• The depth-first search tree structure of \(TK_{\aleph_ 0}\)-free graphs
• Graph minors. XVI: Excluding a non-planar graph
• Clique-sums, tree-decompositions and compactness
• A counter-example to ‘Wagner's conjecture’ for infinite graphs
• Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor
• Excluding Subdivisions of Infinite Cliques
• Excluding infinite clique minors
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Excluding a countable clique