Characterization of co-blockers for simple perfect matchings in a convex geometric graph

Chaya Keller, Micha A. Perles

Consider the complete convex geometric graph on $2m$ vertices, $CGG(2m)$, i.e., the set of all boundary edges and diagonals of a planar convex $2m$-gon $P$. In [C. Keller and M. Pe…