The planar edge-length ratio of n-vertex planar graphs can be Theta(n), 2-trees admit an O(n^0.695) upper bound, and bipartite planar graphs approach ratio 1.
Discrete Applied Mathematics 28(2), 111–134 (1990)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
On the Planar Edge-Length Ratio of Planar Graphs
The planar edge-length ratio of n-vertex planar graphs can be Theta(n), 2-trees admit an O(n^0.695) upper bound, and bipartite planar graphs approach ratio 1.