The Goldberg snarks are a family of snarks discovered by Goldberg (1981) and indexed by odd integers 
, 7, 9, ..., the first few of which are illustrated above.
The construction for Goldberg snarks may be generalized to all (i.e., not just odd) integers 
. In this work, such graphs
are termed Goldberg graphs.
Goldberg snarks are platypus graphs.
Precomputed properties of Goldberg graphs are implemented in the Wolfram Language as GraphData[
"Goldberg", n
].
