ConceptTheory & Algos
Exponential time algorithms for 3-coloring
Solving graph 3-coloring faster than brute force time, such as using time bounds.
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.