Planar CPG graphs
classification
💻 cs.CG
keywords
planarconsequenceexistsgraphgraphsobtainstrictsubclass
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.