Forbidden graphs for degree and neighbourhood conditions (Q1119603)

A subcontraction of a simple graph is a subgraph obtained by successively contracting edges, always removing one edge of each pair of parallel edges formed. ``For various graph-theoretic properties P that impose upper bounds on the minimum degree '' \(\delta\) ``or the size of a neighbourhood set, we characterize the class \({\mathcal G}(P^{\subset}){\mathcal G}(P^ <))\) of graphs G such that G and all its subgraphs (subcontractions) have property P.'' Where P is the property \(G\neq G_ 1,G_ 2,...\), or \(G_ t\), \({\mathcal G}(P^{\subset})\) is written \({\mathcal G}^{\subset}(G_ 1,G_ 2,...,G_ t)\). For example, (Characterization 2.3(a)) ``if P is `\(\delta\leq xn,'\) (... n \(=\) number of vertices, \(0<x<1)\) then \({\mathcal G}(P^{\subset})={\mathcal G}^{\subset}(K_{r+1}),..\). where \(r=\lfloor 1/(1-x)\rfloor\).''