Graph Theory: Prove this group of people can be divided into two groups

48 Views Asked by At

In a party each person has at most 3 friends. Prove that people in the party can be divided into two groups, such that each person has at most one friend in his group.

Any idea how to start the proof?