Planar CPG graphs

Abstract

We show that for any k ≥ 0, there exists a planar graph which is Bk+1-CPG but not Bk-CPG. As a consequence, we obtain that Bk-CPG is a strict subclass of Bk+1-CPG.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…