Recent Progress on Well-Quasi-ordering Graphs
Additional Document Info
Graphs are arguably the first objects studied in the field of well-quasi-ordering. Giant successes in research on well-quasi-ordering graphs and fruitful extensions of them have been obtained since Vzsonyi proposed the conjecture about well-quasi-ordering trees by the topological minor relation in the 1940s. In this article, we survey recent development of well-quasi-ordering on graphs and directed graphs by various graph containment relations, including the relations of topological minor, minor, immersion, subgraph, and their variants.