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.
Celmins-Swart Snarks
See also
SnarkExplore with Wolfram|Alpha
References
Celmins, U. A. and Swart, E. R. "The Constructions of Snarks." Research Report CORR 79-18, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada, 1979.Read, R. C. and Wilson, R. J. An Atlas of Graphs. Oxford, England: Oxford University Press, p. 281, 1998.Cite this as:
Weisstein, Eric W. "Celmins-Swart Snarks." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/Celmins-SwartSnarks.html