Walks, Paths and Connectivity · Superchallenge problem

How many labeled graphs on the vertex set $\{1,2,3,4\}$ have exactly $2$ connected components?