Algorithms for Unipolar and Generalized Split Graphs

Elaine M. Eschen, Xiaoqiang Wang

A graph $G=(V,E)$ is a {\it unipolar graph} if there exits a partition $V=V_1\cup V_2$ such that, $V_1$ is a clique and $V_2$ induces the disjoint union of cliques. The complement…