Polygon-circle graph

Intersection graph of convex polygons whose vertices lie on a common circle

In the mathematical discipline of graph theory, a polygon-circle graph is an intersection graph of a set of convex polygons all of whose vertices lie on a common circle. These graphs have also been called spider graphs. This class of graphs was first suggested by Michael Fellows in 1988, motivated by the fact that it is closed under edge contraction and induced subgraph operations.

This keyword could refer to multiple things. Here are some suggestions: