The Celmins-Swart snarks are the two snarks on 26 vertices and 39 edges illustrated above. They are implemented in the Wolfram Language as GraphData["CelminsSwartSnark1"] and GraphData["CelminsSwartSnark2"], respectively.
The Celmins-Swart snarks are platypus graphs.