Please explain how to solve this problem iteratively using some form of loop:

"In a group of people, it is expected that some of them may not want to work with each other. Assuming that each person has at most x other people that they don't want to work with, divide the people into x + 1 groups so that everyone is in exactly one group, and no one is in a group with someone they don't want to work with."