On well-quasi-ordering-finite graphs by immersion

DOI10.1007/BF02579254zbMath0647.05057OpenAlexW2008736418MaRDI QIDQ1104345

Thomas Andreae

Publication date: 1986

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579254

zbMATH Keywords

graphswell-quasi-ordered

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Ordered sets (06A99) Graph theory (05C99)

Related Items

Recent Progress on Well-Quasi-ordering Graphs ⋮ Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph minors. I. Excluding a forest
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• The theory of well-quasi-ordering: a frequently discovered concept
• Graph minors. IV: Tree-width and well-quasi-ordering
• A Glance at Graph Theory-Part II
• Ordering by Divisibility in Abstract Algebras