Triangulate a torus using the seven vertices of the complete graph and oriented triangles and , with indices modulo seven. Every edge occurs twice with opposite orientations; each vertex has a cyclic link. The Euler characteristic is . Its dual graph is the Heawood graph. This dual map has seven disc faces, each adjacent to all the others, so it needs seven face colors although its edges have a Tait coloring.
New to topics? Read the docs here!