Abstract

A fundamental graph problem is to recognize whether the vertex set of a graph G can be bipartitioned into sets A and B such that G[A] and G[B] satisfy properties ΠA and ΠB, respectively. This so-called (ΠA, ΠB)-Recognition problem generalizes amongst others the recognition of 3-colorable, bipartite, split, and monopolar
... read more