Graph coloring

From Cohen Courses
Revision as of 00:13, 1 April 2011 by Aoverwij (talk | contribs) (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.…')
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search

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.

For more information see the wiki page about graph coloring.

Retrieved from "http://curtis.ml.cmu.edu/w/courses/index.php?title=Graph_coloring&oldid=5258"