Before revision:  Moreover, we show that the same remains true even within the class of planar graphs in the case k \geq } 3. Additionally, we examine the computational complexity of several graph problems restricted to CPG graphs .
After revision:  Moreover, we show that the same remains true even within the class of planar graphs in the case k \geq } 3. We then consider several graph problems restricted to CPG graphs .