On realizing all simple graphs with a given degree sequence
Hyunju Kim, Zoltán Toroczkai · 2008
We give a necessary and sufficient condition for a sequence of nonnegative integers to be realized as a simple graph’s degree sequence such that a given (but otherwise arbitrary) set of possible connections from a node are avoided. We then use this result to present a procedure that builds all simple graphs realizing a given degree sequence.