Planar graphs, chromatic numbers, maps. Network Flows: Max-flow min-cut theorem.
A problem-oriented approach flips the traditional classroom model. Instead of memorizing a theorem and then looking for a place to apply it, you start with a concrete challenge.
Based on the comparison of PDF resources, we recommend:
