Hereditary unigraphs and Erdős-Gallai equalities

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.