Claims

../

1992_06_01_alon_tarsi: Alon and Tarsi's 1992 theorem that every planar bipartite graph has list chromatic number at most 3, deduced from their algebraic criterion on orientations with unequal counts of even and odd Eulerian subgraphs.

---