Finding all non isomorphic graphs of a given degree sequence Is there is a general way to draw all the non-isomorphic graphs of a given degree sequence?
We can use Havel Hakimi's algorithm to find graphs for a given degree sequence, but how do we find all the non-isomorphic graphs? 
 A: Faradzhev, I. A.: Generation of nonisomorphic graphs with a given degree sequence. In: Algorithmic Studies in Combinatorics, Nauka, Moscow, 1978
Read, R. C.: Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations. Ann. Discr. Math. 2 (1978) 107-120
Colbourn, Ch. J.; Read, R. C.: Orderly algorithms for graph generation. 1979
for chemical molecules:
MOLGEN
MOLGEN online
Grund, R.; Kerber, A.; Laue, R.: Construction of Discrete Structures, Especially Isomers. 1996
Sage Common Graphs:
"Generate all graphs with a specified degree sequence"
McKay, B. D.: Isomorph-Free Exhaustive generation. J. Algor. 26 (1998) (2) 306-324^
Latapy, M.: Graph generation software
Viger, F.; Latapy, M.: Fast generation of random connected graphs with prescribed degrees. 2005
Fabien Viger, F.; Latapy, M.: Efficient and simple generation of random simple
connected graphs with prescribed degree sequence. 2005
Isomorph-Free Exhaustive Generation. In: Kaski, P.; Östergård, P. R. J.: Classification Algorithms for Codes and Designs, Springer, 2006, 105-143
Shin-ichi Nakano: Listing All Trees with Specified Degree Sequence. 2008
Király's Method for Generating All Graphs from a Degree Sequence
Király, Z.: Recognizing graphic degree sequences and generating all realizations. 2011
Hartke, S.: Graph generation (2011?)
Hartke, S. G.: McKay's Canonical Graph Labeling Algorithm
