Bounded-Degree Graphs can have Arbitrarily Large Slope Numbers
We construct graphs with $n$ vertices of maximum degree $5$ whose every straight-line drawing in the plane uses edges of at least $n^{1/6-o(1)}$ distinct slopes.
2017 ◽
Vol 166
(1)
◽
pp. 61-74
◽
Keyword(s):
Keyword(s):
Keyword(s):
2011 ◽
Vol Vol. 13 no. 1
(Graph and Algorithms)
◽
2012 ◽
Vol 21
(1-2)
◽
pp. 229-253
◽
Keyword(s):
2010 ◽
Vol 19
(5-6)
◽
pp. 693-709
◽
Keyword(s):
Keyword(s):