TOPICS
Search

Goldberg Graph


GoldbergGraphs

Goldberg graphs are a name given in this work to the generalization of the Goldberg snarks of order n=5, 7, 9, ... to all integers n>=3. They are illustrated above for n=3 to 7.

Precomputed properties of Goldberg graphs are implemented in the Wolfram Language as GraphData[{"Goldberg", n}].


See also

Goldberg Snark

Explore with Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Goldberg Graph." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/GoldbergGraph.html

Subject classifications