Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs

Tomohiro Koana, Nidhi Purohit, Kirill Simonov

In Clique Cover, given a graph $G$ and an integer $k$, the task is to partition the vertices of $G$ into $k$ cliques. Clique Cover on unit ball graphs has a natural interpretation…