Smith's Network Theorem

In a Network with three Edges at each Vertex, the number of Hamiltonian Circuits through a specified Edge is 0 or Even.

See also Edge (Graph), Hamiltonian Circuit, Network