ConceptTheory & Algos
Baker's theorem for planar graphs
Any planar graph's edges can be partitioned into sets in polynomial time such that deleting or contracting any single set yields a graph of treewidth .
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.