Fritsch graph


In the mathematical field of graph theory, the Fritsch graph is a planar graph with 9 vertices and 21 edges.
It was obtained by Fritsch as a minimal sized counterexample to the Alfred Kempe's attempt to prove the four-color theorem.