Induced minors and well-quasi-ordering... Robin Thomas showed that K 4-induced minor-free graphs are well-quasi-ordered by induced minors [Graphs without K 4 and well-quasi-ordering, Journal of Combinatorial Theory, Series B, 38(3):240-247, 1985]....
Well-quasi-ordering infinite graphs with forbidden finite planar minor... The proof is complex and makes use of an excluded minor theorem of Robertson and Seymour, its extension to infinite graphs, Nash-Williams ' theory of better-quasi-ordering, especially his infinite tree theorem, and its extension to something we call tree-structures over QOcategories, which includes infinitary version of a well-quasi-ordering...
Well-quasi-ordering of combinatorial structuresIn this work we study the notion of well-quasi-ordering for various partial orders and its relation to some other notions, such as clique-width....
Well-quasi-ordering versus clique-widthDoes well-quasi-ordering by induced subgraphs imply bounded clique-width for hereditaryclasses? This question was asked by Daligault, Rao, and Thomass ́e [Well-quasi-order ofrelabel functions....
