A well-founded tree T defined on the vertex set of a graph G is called normal if the endvertices of any edge of G are comparable in T. We study how normal trees can be used to describe the structure ...

We prove that given any sequence $G_1, G_2,\ldots$ of graphs, where $G_1$ is finite planar and all other $G_i$ are possibly infinite, there are indices $i,j$ such ...