431 search results - page 31 / 87 » Bold Graph Drawings |
SIAMCOMP
2002
14 years 10 months ago
2002
GC
2010
Springer
14 years 9 months ago
2010
Springer
IPL
2010
14 years 9 months ago
2010
66
Voted
TCS
2010
14 years 9 months ago
2010
JCT
2007
14 years 11 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...