English

Planar CPG graphs

Computational Geometry 2018-10-19 v1

Abstract

We show that for any k0k \geq 0, there exists a planar graph which is Bk+1B_{k+1}-CPG but not BkB_k-CPG. As a consequence, we obtain that BkB_k-CPG is a strict subclass of Bk+1B_{k+1}-CPG.

Keywords

Cite

@article{arxiv.1810.08008,
  title  = {Planar CPG graphs},
  author = {Nicolas Champseix and Esther Galby and Bernard Ries},
  journal= {arXiv preprint arXiv:1810.08008},
  year   = {2018}
}
R2 v1 2026-06-23T04:44:26.582Z