Cubic planar graphs that cannot be drawn on few lines
For every integer $\ell$, we construct a cubic 3-vertex-connected planar bipartite graph $G$ with $O(\ell^3)$ vertices such that there is no planar straight-line drawing of $G$ whose vertices all lie on $\ell$ lines. This strengthens previous results on graphs that cannot be drawn on few lines, whic...
保存先:
| 第一著者: | |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
Carleton University
2021-12-01
|
| シリーズ: | Journal of Computational Geometry |
| オンライン･アクセス: | https://jocg.org/index.php/jocg/article/view/3250 |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|