I don't have Mathematica, yet, but I just wanted to know what the output of the following was:

`GraphData["Cubic", 20]`

I'm trying to understand how many unique not-necessarily-connected cubic graphs on $20$ vertices there are. Like, [these](http://mathworld.wolfram.com/DodecahedralGraph.html) are all connected cubic graphs on 20 vertices, but I know there are other arrangements (disjoint ones too). For example, you could have two cubic graphs on 4 vertices and two cubic graphs on 6 vertices, which gives 20 vertices all with degree 3, but there are four disjoint graphs that make them up. What am I looking for? I want to see all the unique ways 20 vertices can all have degree 3.

---

Update: `GraphicsGrid[GraphData/@GraphData["Cubic",20],"AllImages"]` produces the following: <http://docdro.id/p9Rim76>