ConceptTheory & Algos
Three-coloring
A CSP where the domain consists of red, green, and blue, and the constraints require adjacent vertices to have unequal colors.
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
2The lectures that define it or assume it, and the concepts next to it.