Minimum clique partition in unit disk graphs

Adrian Dumitrescu, János Pach

The minimum clique partition (MCP) problem is that of partitioning the vertex set of a given graph into a minimum number of cliques. Given $n$ points in the plane, the correspondin…