| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4647524 | Discrete Mathematics | 2013 | 13 Pages |
Abstract
The degree sequence characterization of hereditary unigraphs makes use of the list of values k for which the kth ErdÅs-Gallai inequality holds with equality for a graphic sequence. Using the canonical decomposition of Tyshkevich, we show how this list describes structure common among all realizations of an arbitrary graphic sequence.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Michael D. Barrus,