## Graph theory problem (critical graphs)

Problem: Let G be a critical graph. Show that for each separating set S of G, the subgraph induced by S is not a complete graph.

I guess I should assume that S is complete, which leads to a contradiction. Could someone help me a bit with this?