On the colorability of graphs decomposable into degenerate graphs with specified degeneracy.
Robert T. Klein, Johanan Schönheim · 1995
every subgraph of which has minimal at most m. An (mI, m2,..., the set of which can be partitioned into s sets generating rpc,,,prtlvplv We conjecture that such a graph is)J colorable. Partial results is settled. ~VU"Uv',"". but not even Tarsi's case: ml = 1, m2 = 2 The following two definitions of 1.