Planar 4-critical graphs with four triangles

By the Grünbaum–Aksenov Theorem (extending Grötzsch’s Theorem) every planar graph with at most three triangles is 33-colorable. However, there are infinitely many planar 4-critical graphs with exactly four triangles. We describe all such graphs. This answers a question of Erdős from 1990.