Before revision:  We further show that Recognition is \mathsf{NP B_k-CPG  with k \geq -complete.
After revision:  The main result of the paper is that recognizing CPG graphs and B_k-CPG with k \geq -complete.