431 search results - page 31 / 87 » Bold Graph Drawings |
GC
2010
Springer
15 years 2 months ago
2010
Springer
IPL
2010
15 years 2 months ago
2010
151
click to vote
JCT
2007
15 years 3 months ago
2007
We give a new upper bound for the rectilinear crossing number cr(n) of the complete geometric graph Kn. We prove that cr(n) ≤ 0.380559 ¡n 4 ¢ + Θ(n3 ) by means of a new const...