Seven criteria for integer sequences being graphic
Gerard Sierksma, Han Hoogeveen · Journal of Graph Theory · 1991
Abstract Seven criteria for integer sequences being graphic are listed. Being graphic means that there is a simple graph with the given integer sequence as degree sequence. One of the criteria leads to a new and constructive proof of the well‐known criterion of Erdös‐Gallai.