GoldbergSnark(5).mws

>    with(GraphTheory):with(SpecialGraphs):

>    G := GoldbergSnark(5);

G := `Graph 18: an undirected unweighted graph with 40 vertices and 60 edge(s)`

>    DrawGraph(G);

[Maple Plot]

>    DrawGraph(G,style=spring,dimension=3);

[Maple Plot]

>   

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