Heawood graph 2026-10-14
The bipartite cubic graph with vertices , , and edges . The three offsets give a Tait coloring.
Tait coloring 2026-10-14
A proper three-color edge coloring of a cubic graph. Label its colors by the nonzero elements of : the incident colors at each vertex then sum to zero. On a planar map without bridges in a graph, integrating these labels on the dual graph gives a four-color face coloring. On a torus, a nonzero period can obstruct this integration.