Problem: Cochromatic colouring

Definition:
(decision variant)
Input: A graph G in this class and an integer k.
Output: True iff the vertices of G can be partitioned into at most k sets, such that each partite set induces either an independent set or a clique in G.

Linear

Polynomial

GI-complete

NP-hard

NP-complete

coNP-complete

Open

Unknown to ISGCI