Encyclopedia of Graphs

A snark is a connected bridgeless cubic graph (i.e., a biconnected cubic graph) with edge chromatic number of four (i.e. it cannot be properly edge-coloured using 3 colours). The census lists all snarks up to the order 30 and was provided by The House of Graphs (source).

OEIS: A130315

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