We are given an undirected and unweighted graph and a non-negative integer K.
- We have to partition the vertices of the graph into, at most, K partitions such that all vertices of each partition are connected by an edge
- It is allowed for vertices of different partitions to be connected.