129258
20190316234423.0
10.1016/j.comgeo.2007.05.003
doi
ARTICLE
Drawing cubic graphs with at most five slopes
2008
2008
Journal Articles
Professor Pach's number: [206]. Also in: Graph Drawing 2006, Lecture Notes in Computer Science 4372, Springer, 2007, 114-125.
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 G is connected and has at least one vertex of degree less than three, then four directions suffice.
straight-line drawing
slope number
Keszegh, Balázs
194132
243575
Pach, János
183120
243577
Pálvölgyi, Dömötör
184485
243572
Tóth, Géza
138-147
2
Computational Geometry - Theory and Applications
40
URL
URL
173958
n/a
http://infoscience.epfl.ch/record/129258/files/Keszegh_2008_Computational-Geometry.pdf
DCG
252234
U11887
oai:infoscience.tind.io:129258
article
SB
GLOBAL_SET
DCG-ARTICLE-2008-002
pre05268583/DCG
OTHER
PUBLISHED
REVIEWED
ARTICLE