Let be the lattice of hereditary and additive properties of graphs. A reducible property is called minimal reducible bound for a property if in the interval of the lattice , there are only irreducible properties. We prove that the set is the covering set of minimal reducible bounds for the class of all -degenerate graphs.