A graph that can be drawn with every edge angle above 60 degrees has at most 2n−6 edges, apart from explicitly listed small exceptions, and deciding if such a drawing exists is NP-hard.
Chicago Journal of Theoretical Computer Science 4, 1--14 (2011)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Graphs with large total angular resolution
A graph that can be drawn with every edge angle above 60 degrees has at most 2n−6 edges, apart from explicitly listed small exceptions, and deciding if such a drawing exists is NP-hard.