A note on "A note on 'Some simplified NP-complete graph problems'"

In [3] we state that the largest degree bounds for which we know this problem to be easy are 2-In, 1-Out or 2-Out, l-ln. (In fact the problem is easy whenever all vertices have in-degree i or all vertices have outdegree i.) However, it should not be inferred that the problem is easy for the mixed case in which each vertex satisfies one or the other of these bounds, which indeed would imply that the 2-1n, 2-Out case is easy.