Is the complexity of approximating Vertex Cover of degree 3 open? (ADDED LATER-NO)

 RECALL:

A max-problem f has a A P Time App Scheme (PTAS) if there is an algorithm ALG such that

 ALG(\epsilon) \ge (1-\epsilon)f(x).

A min-problem f has a A P Time App Scheme (PTAS) if there is an algorithm ALG such that

 ALG(\epsilon) \le (1+\epsilon)f(x).

(Note that the poly can depend on epsilon so it may be something like n^{1/epsilon}.)

MAX3SAT is, given a formula with \le 3 literals per clause, find an assignment

that maximized the number of clauses satisfied.

VCB-a is Vertex cover where graphs have degree \le a

The following are known:

0) MAX3SAT is in APX.

1) The PCP paper, here, showed that if MAX3SAT has a PTAS then P=NP.

2) Papadimitriou and Yannakakis (here)  had showed much earlier that MAX3SAT \le VCB-4 with an approx preserving reduction.

3) From (1) and (2) we have that VCB-4 has a PTAS then P=NP. (VC is in APX by an easy 2-approx).

4) Clearly VCB-2 is in P.

The following seems to be open, though if you know otherwise pleae leave a comment:

Is VCB-3 a) in P? b) NPC? (ADDED LATER- NPC- See comments.) 

Is the following true: if VCB-3 has a PTAS then P=NP. (ADDED LATER- NO PTAS-See Comments)

NOTE- all of the above is true for Ind Set-4 and Dom Set-4. So that leads to more open problems.