Planar CPG graphs
arXiv:1810.08008
Abstract
We show that for any , there exists a planar graph which is -CPG but not -CPG. As a consequence, we obtain that -CPG is a strict subclass of -CPG.
arXiv:1810.08008
We show that for any , there exists a planar graph which is -CPG but not -CPG. As a consequence, we obtain that -CPG is a strict subclass of -CPG.