# Two-Coloring

### From Progteam

A graph is **Two-Colorable** if and only if each of its vertices can be assigned one of two colors, such that no two adjacent vertices have the same color. A graph being two colorable implies that it has no odd cycles.

A graph is **Two-Colorable** if and only if each of its vertices can be assigned one of two colors, such that no two adjacent vertices have the same color. A graph being two colorable implies that it has no odd cycles.