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