Subdividing a graph toward a unit-distance graph in the plane. On the number of acute triangles in a straight-line embedding of a maximal planar graph. On the graph represented by a family of solid balls on a table.
Every graph is an integral distance graph in the plane.
European J. Combin. A few applications of negative-type inequalities. Metric extensions and the L 1 hierarchy. Independent balls and unit neighborhood graphs. On the dimension to represent a graph by a unit distance graph.