A graph whose vertices can be split into two groups so that every edge joins different groups. Equivalent to having no odd-length cycle.
Bipartite graph
A graph whose vertices can be split into two groups so that every edge joins different groups. Equivalent to having no odd-length cycle.