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 Erdos-Gallai.
| Original language | English |
|---|---|
| Pages (from-to) | 223-231 |
| Number of pages | 9 |
| Journal | Journal of graph theory |
| Volume | 15 |
| Issue number | 2 |
| Publication status | Published - Jun-1991 |