ConceptTheory & Algos
3-Coloring problem
The problem of determining whether the vertices of an undirected graph can be colored using at most three colors 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.