Revision history of "Two-Coloring"

From Progteam

Jump to: navigation, search

Diff selection: mark the radio boxes of the revisions to compare and hit enter or the button at the bottom.

Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.
  • (cur | prev) 07:28, 28 February 2007 Hjfreyer (Talk | contribs) (New page: 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 colorab...)
Personal tools