Graph Minors. XIX. Well-quasi-ordering on a surface

In a previous paper (J. Combin. Theory 48 (1990) 255) we showed that for any infinite set of (finite) graphs drawn in a fixed surface, one of the graphs is isomorphic to a minor of another. In this paper we extend that result in two ways: • eralize from graphs to hypergraphs drawn in a fixed surface, in which each edge has two or three ends, and ges of our hypergraphs are labelled from a well-quasi-order, and the minor relation is required to respect this order. result is another step in the proof of Wagnerʹs conjecture, that for any infinite set of graphs, one is isomorphic to a minor of another.