Faster Algorithms for Graph Monopolarity

Geevarghese Philip, Shrinidhi Teganahally Sridhara

A graph $G=(V,E)$ is $\text{monopolar}$ if its vertex set admits a partition $V=(C\uplus I)$ where $G[C]$ is a $\text{cluster graph}$ and $I$ is an $\textit{independent…