Hello!

My problem is:
Given a graph (for example as adjecency lists), find the number of ways to arrange it into a clique and a independent set, both non-empty.

This is to be done in O(n^2).

Any tips will be appreciated.