Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6875612 | Theoretical Computer Science | 2018 | 23 Pages |
Abstract
A subcubic planar graph is a planar graph whose vertices have degree at most 3. We show that the subcubic planar graphs with at least five vertices have planar slope number at most 4, which is worst-case optimal. This answers an open question by JelÃnek et al. [10]. Furthermore, we prove that the subcubic planar graphs with at least five vertices have angular resolution Ï/4, which solves an open problem by Kant [11] and by Formann et al. [8].
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani,