[2] They were discovered by Yugoslavian mathematician Danilo Blanuša in 1946 and are named after him.

[3] When discovered, only one snark was known—the Petersen graph.

As snarks, the Blanuša snarks are connected, bridgeless cubic graphs with chromatic index equal to 4.

Both of them have chromatic number 3, diameter 4 and girth 5.

[4] Both have book thickness 3 and queue number 2.

The Blanuša snarks are the smallest members those two infinite families.

[6] In 2007, J. Mazák proved that the circular chromatic index of the type 1 generalized Blanuša snarks

[7] In 2008, M. Ghebleh proved that the circular chromatic index of the type 2 generalized Blanuša snarks