Every 4-connected plane triangulation on n vertices has a straight-line drawing whose vertices lie on at most sqrt(2n) horizontal or vertical lines, and the same holds for all subgraphs.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
4-Connected Triangulations on Few Lines
Every 4-connected plane triangulation on n vertices has a straight-line drawing whose vertices lie on at most sqrt(2n) horizontal or vertical lines, and the same holds for all subgraphs.