Among the intuitively appealing aspects of graph theory is its close connection to drawings
and geometry. The development of computer technology has become a source of motivation …

Convex Quadrilaterals and k-Sets Page 1 Convex Quadrilaterals and k-Sets László Lovász∗
Katalin Vesztergombi† Uli Wagner‡ Emo Welzl§ April 30, 2003 Abstract We prove that the …

A graph G=(V, E) is planar, if it can be drawn in the plane so that its edges are Jordan curves
and they intersect only at their endnodes 1. A plane map is a planar graph with a fixed …

Graphs and Combinatorics Page 1 Digital Object Identifier (DOI) 10.1007/s00373-005-0612-5
Graphs and Combinatorics (2005) 21:293–300 Graphs and Combinatorics © Springer-Verlag …

It has been long conjectured that the crossing number \Cr(K_m,n) of the complete bipartite
graph K_m,n equals the Zarankiewicz number Z(m,n):=m-12m2n-12n2. Another …

We extend the order type data base of all realizable order types in the plane to point sets of
cardinality 11. More precisely, we provide a complete data base of all combinatorial different …

Selected Open Problems in Graph Drawing | SpringerLink Skip to main content Advertisement
SpringerLink Account Menu Find a journal Publish with us Track your research Search Cart Book …

We investigate the number of plane geometric, ie, straight-line, graphs, a set S of n points in
the plane admits. We show that the number of plane geometric graphs and connected plane …

We provide a new lower bound on the number of (≤ k)-edges of a set of n points in the
plane in general position. We show that for 0≦k≦⌊(n-2)/2⌋ the number of (≤ k)-edges is at …

62] Turan, P., A note of welcome, J. Graph Theory 1 (1977) 7-9. 63] Dambitis, J., An
algorithm for superimposing a nonplanar graph onto the plane with nearly minimal number …