Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor

DOI10.2307/2001217zbMath0676.05069MaRDI QIDQ3831057

Robin Thomas

Publication date: 1989

Full work available at URL: https://doi.org/10.2307/2001217

zbMATH Keywords

infinite graph; better-quasi-ordering; well-quasi- ordering; minor of a graph

Mathematics Subject Classification ID

06A06: Partial orders, general

05C05: Trees

05C10: Planar graphs; geometric and topological aspects of graph theory

05C99: Graph theory

Related Items

End spaces and tree-decompositions, On Andreae's ubiquity conjecture, Unprovability threshold for the planar graph minor theorem, Linked tree-decompositions of represented infinite matroids, Some recent progress and applications in graph minor theory, A Menger-like property of tree-width: The finite case, The Menger-like property of the three-width of infinite graphs, Excluding a countable clique, On immersions of uncountable graphs, Unavoidable doubly connected large graphs, Graph-like spaces: an introduction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph minors. V. Excluding a planar graph
• A Menger-like property of tree-width: The finite case
• On Fraissé's order type conjecture
• Wohlquasigeordnete Klassen endlicher Graphen
• The theory of well-quasi-ordering: a frequently discovered concept
• Graph minors. IV: Tree-width and well-quasi-ordering
• Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees
• Graph minors. II. Algorithmic aspects of tree-width
• Logic and Combinatorics
• A counter-example to ‘Wagner's conjecture’ for infinite graphs
• Borel sets and Ramsey's theorem
• Graph minors and linkages
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Ordering by Divisibility in Abstract Algebras
• Partial well‐ordering of sets of vectors