Tietze's graph

Tietze's graph
The Tietze graph
Vertices	12
Edges	18
Radius	3
Diameter	3
Girth	3
Automorphisms	12 (D6)
Chromatic number	3
Chromatic index	4
Properties	Cubic Snark
Table of graphs and parameters

In the mathematical field of graph theory, Tietze's graph is an undirected cubic graph with 12 vertices and 18 edges. It is named after Heinrich Franz Friedrich Tietze, who showed in 1910 that the Möbius strip can be subdivided into six regions that all touch each other – three along the boundary of the strip and three along its center line – and therefore that graphs that are embedded onto the Möbius strip may require six colors.^[1] The boundary segments of the regions of Tietze's subdivision (including the segments along the boundary of the Möbius strip itself) form an embedding of Tietze's graph.