2000 character limit reached
Planar CPG graphs
Published 18 Oct 2018 in cs.CG | (1810.08008v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.