Excluding infinite minors
From MaRDI portal
Publication:1191928
DOI10.1016/0012-365X(91)90343-ZzbMath0759.05082MaRDI QIDQ1191928
P. D. Seymour, Robin Thomas, Neil Robertson
Publication date: 27 September 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Every infinitely edge-connected graph contains the Farey graph or \({T_{\aleph_0}\ast t}\) as a minor ⋮ Ends of semigroups ⋮ Representations of infinite tree sets ⋮ Some recent progress and applications in graph minor theory ⋮ Graph-theoretical versus topological ends of graphs. ⋮ The structure of rayless graphs ⋮ Decomposing infinite graphs ⋮ Excluding Subdivisions of Infinite Cliques ⋮ Normal Tree Orders for Infinite Graphs ⋮ Excluding a countable clique
Cites Work
- Unnamed Item
- Graph minors. XX: Wagner's conjecture
- Graph minors. I. Excluding a forest
- Interval graphs and searching
- Graph minors. V. Excluding a planar graph
- The Menger-like property of the three-width of infinite graphs
- Quickly excluding a forest
- Graph searching and a min-max theorem for tree-width
- Quickly excluding a planar graph
- Graph minors. XIX: Well-quasi-ordering on a surface.
- Clique-sums, tree-decompositions and compactness
- A counter-example to ‘Wagner's conjecture’ for infinite graphs
- Excluding Infinite Trees
- Excluding infinite clique minors
- Über die Maximalzahl fremder unendlicher Wege in Graphen
- Graphen ohne unendliche Wege
- Zusammenzüge und Unterteilungen von Graphen
