Planar CPG graphs

10/18/2018
by   Nicolas Champseix, et al.
0

We show that for any k ≥ 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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset