The statement for graphs, graph classes and $Algorithm.Computes$, from the version for simple graphs applied to the class of the simple graphs of the members. The algorithm is the program with its exponent, the chain of a graph is that of its simple graph, and the constant $c$ becomes $⌈c · 2^(3+δ)⌉$, so that $c' · n^(3+δ) + c'$ bounds the time $⌊c · (n+1)^(3+δ)⌋$.