In the mathematical field of graph theory, the Watkins snark is a snark with 50 vertices and 75 edges.

[3] As a snark, the Watkins graph is a connected, bridgeless cubic graph with chromatic index equal to 4.

The Watkins snark is also non-planar and non-hamiltonian.

It has book thickness 3 and queue number 2.

This graph theory-related article is a stub.