Difference between revisions of "Graph coloring"
From Cohen Courses
Jump to navigationJump to search (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.…') |
(No difference)
|
Latest revision as of 00:13, 1 April 2011
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.
