Name
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.comgeo.2007.05.003 | Computational Geometry: Theory and Applications |
Keywords | DocType | Volume |
maximum degree,different slope,cubic graph,straight-line drawing,connected component,graph g,slope number,directions suffice | Conference | 40 |
Issue | ISSN | Citations |
2 | Computational Geometry: Theory and Applications | 16 |
PageRank | References | Authors |
1.16 | 10 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Balázs Keszegh | 1 | 156 | 24.36 |
| János Pach | 2 | 2366 | 292.28 |
| Dömötör Pálvölgyi | 3 | 202 | 29.14 |
| Géza Tóth | 4 | 581 | 55.60 |