1.gif){kind=small}
| > | with(GraphTheory):with(SpecialGraphs): |
| > | G := GoldbergSnark(5); |
| > | DrawGraph(G); |
![[Maple Plot]](images/GoldbergSnark(5)2.gif)
| > | DrawGraph(G,style=spring,dimension=3); |
![[Maple Plot]](images/GoldbergSnark(5)3.gif)
| > |
Mark K. Goldberg, Construction of class 2 graphs with maximum vertex degree 3, Journal of Combinatorial Theory, Series B, Volume 31, 282-291
Snarks: http://www.ijp.si/vega/htmldoc/MANUAL/EXMPLS15.HTM
http://www.ijp.si/vega/htmldoc/LOGS/exmpls15.htm#GoldbergSnark[10]
Al Erickson, Mohammad Ghebleh, Simon Lo, Michael Monagan, New Features of the GraphTheory Package