The Goldberg graphs are a family of graphs discovered by Goldberg (1981) which are snarks for 
, 7, 9, ....
Precomputed properties of Goldberg graphs are implemented in the Wolfram Language as GraphData[
"Goldberg", n
].
Goldberg Snark
See also
SnarkExplore with Wolfram|Alpha
References
Goldberg, M. K. "Construction of Class 2 Graphs with Maximum Vertex Degree 3." J. Combin. Th. Ser. B 31, 282-291, 1981.Cite this as:
Weisstein, Eric W. "Goldberg Snark." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/GoldbergSnark.html