diagonal intersection graph | regular polygon diagonal intersection graph

Consider the plane figure obtained by drawing each diagonal in a regular polygon with n vertices. If each point of intersection is associated with a node and diagonals are split ar each intersection to form segments associated with edges, the resulting figure is a planar graph here termed the polygon diagonal intersection graph and denoted R_n.

complete graph | Euler's polygon division problem | polygon diagonal | regular polygon | regular polygon division by diagonals