Polar and monopolar graphs are natural generalizations of bipartite or split graphs. A graph G = (V,E) is polar if its vertex set admits a partition V = A∪B such thatA induces a complete multipartite and B the complement of a complete multipartite graph. If A is even a stable set then G is called monopolar. Recognizing general polar or monopolar graphs is NP-complete and, as yet, efficient reco...