The Heawood approach to Tait colorings and defining vertex sets

E. Yu. Lerner

Given a simple biconnected planar cubic graph, we associate each its vertex among $2n$ ones with the so-called spin, i.e., a variable which takes on values $\pm 1$. P. J. Heawood h…