Wohlquasigeordnete Klassen endlicher Graphen

AbstractG′ ≤ G means that G contains a subdivision of G′ and we define G′ ≤ G if and only if G is contractible into a graph some subgraph of which is isomorphic to G′. It is shown that ≤ is a well-quasi-ordering for all finite graphs with at most n disjoint circuits (where n is any fixed natural number) and that all graphs not contractible into a V5− (the complete graph V5 minus one edge) are well-quasi-ordered by ≤