2000 character limit reached
Planar CPG graphs (1810.08008v1)
Published 18 Oct 2018 in cs.CG
Abstract: We show that for any $k \geq 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.