ConceptTheory & Algos
3-Coloring
The problem of assigning one of three colors to each vertex of an undirected graph such that no two adjacent vertices share the same color.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.