Some Matching Theorems
A graph G is said to be even if its vertices can be put into two distinct classes A and B so that no two vertices of the same class are joined by an edge.
A graph G is said to be even if its vertices can be put into two distinct classes A and B so that no two vertices of the same class are joined by an edge.