Revision history of "Graph coloring"

From Cohen Courses
Jump to navigationJump to 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.

  • curprev 00:13, 1 April 2011‎ Aoverwij talk contribs‎ 286 bytes +286‎ Created page with 'A famous problem from graph theory, given a graph what is the minimal number of colors needed to give each vertex a color such that no two neighbor vertices share the same color.…'
Retrieved from "http://curtis.ml.cmu.edu/w/courses/index.php/Graph_coloring"