Edge-4-critical graphs
An edge-4-critical graph, is a graph that is connected, is not (vertex) 3-colourable, and G-e is 3-colourable for every edge e. The following collection was calculated Brendan McKay (source) and lists all connected edge-4-critical graphs on up to 13 vertices.