Bi Partite
|
AllPages RecentChanges Links to this page Edit this page Search Entry portal |
|
|
|
Bi Partite |
|
||||
A graph $G=(V,E)$ is bi-partite if the vertex set $V$ can be partitioned into two sets $V_0$ and $V_1$, such that $V_i$ has no edges. In other words, all edges run between the $V_i$ and not within, so $V_i^2 \cap E = \{\}$.
A graph is 2-colourable iff it is bi-partite.
A graph is bi-partite iff every cycle is of even length.
See also: tri-partite