Publication | Closed Access
Seven criteria for integer sequences being graphic
112
Citations
6
References
1991
Year
Integer SequencesCombinatorics On WordGraph TheorySeven CriteriaAbstract Seven CriteriaEnumerative CombinatoricsComputer ScienceDiscrete MathematicsPattern MatchingInteger Sequence
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.
| Year | Citations | |
|---|---|---|
Page 1
Page 1