| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 414419 | Computational Geometry | 2008 | 10 Pages |
Abstract
We show that every graph G with maximum degree three has a straight-line drawing in the plane using edges of at most five different slopes. Moreover, if every connected component of G has at least one vertex of degree less than three, then four directions suffice.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
