Two-Coloring

From Progteam

Revision as of 07:28, 28 February 2007 by Hjfreyer (Talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

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.

Personal tools