Integral Drawings of the Complete Graph K6
Arnfried Kemnitz · 1990
A drawing D ( G ) of a graph G is such a realization of G in the plane that the vertices of G are mapped into different points, called vertices of D ( G ), and the edges of G are mapped into Jordan curves connecting the maps of the incident vertices, called edges of D ( G ), and two edges of D ( G ) have at most one point in common, either a vertex or a crossing. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.