The name for the graph, where the disk connecting the two points does not contain other points?

Question

The problem is this:

This is the set of points P on a two-dimensional plane. Each of the two points (p, q) is connected by edges if there exists a circle with diameter pq that DOES NOT contain any other points from P and if p and q are on the circle. (so p and q are endpoints of the diameter of the circle)

Does anyone know what the name of this type of chart is?

Answer 1

This is called the graph of Gabriel .

. , , . , .

Answer 2

, planar, , . , , . , , , (, e1 e2, ). ( ).