ConceptTheory & Algos
4-Colorability
The property of a graph where vertices can be colored using four 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.
Graph coloring1Graph theory1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.