List all possible non-isomorphic graphs of order 6 and size 13.
So I started drawing graphs and I just think there has to be a theorem or a more efficient way of listing these graphs than by drawing them out one by one. Any help, leads, hints will be appreciated. Thanks!