| Author: | Tripathi, Amitabha; Vijay, Sujith |
| Advisor: | Advisor |
| Date: | 2003
|
| Publisher: | |
| Citation: | Discrete M
|
| Series/Report no.: |
|
| Item Type: | Article
|
| Keywords: | Degree sequence; Graphical sequence |
| Abstract: | We show that the Erds–Gallai condition characterizing graphical degree sequences of length p needs to be checked only for as many n as there are distinct terms in the sequence, not all n,1≤n≤p. |
