Title of article
A note on a theorem of Erdős & Gallai
Author/Authors
Amitabha Tripathi، نويسنده , , Thomas Robinson and Sujith Vijay، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
4
From page
417
To page
420
Abstract
We show that the Erdős–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.
Keywords
Degree sequence , Graphical sequence
Journal title
Discrete Mathematics
Serial Year
2003
Journal title
Discrete Mathematics
Record number
949112
Link To Document