Planar CPG graphs
share
We show that for any k ≥ 0, there exists a planar graph which is B_k+1-CPG but not B_k-CPG. As a consequence, we obtain that B_k-CPG is a strict subclass of B_k+1-CPG.
READ FULL TEXTWe show that for any k ≥ 0, there exists a planar graph which is B_k+1-CPG but not B_k-CPG. As a consequence, we obtain that B_k-CPG is a strict subclass of B_k+1-CPG.
READ FULL TEXT