Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Planar CPG graphs (1810.08008v1)

Published 18 Oct 2018 in cs.CG

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.

Summary

We haven't generated a summary for this paper yet.