Encyclopedia of Graphs

A graph is said to be edge-critical if its chromatic number drops whenever an edge is deleted. Every edge-critical graph is also vertex-critical. The following collection was calculated by Gordon Royle (source) and lists edge-critical graphs on 4 up to 12 vertices.

Only signed in users can post comments. Sign in here
Don't have an account yet? Register here