The Kittell graph is a planar graph on 23 nodes and 63 edges that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof of the four-color theorem fails.
It is also an identity graph.
The Fritsch graph and Soifer graph provide smaller (and in fact the smallest possible) counterexamples.
