In 1991, it was shown by Favaron, Mahéo, and Saclé that the residue, which is defined as the number of zeros remaining when the Havel-Hakimi algorithm is applied to a degree sequence, yields a lower bound on the independence number of any graph realising the sequence. In 1996, Triesch simplified and generalised the result by introducing elimination sequences. It was proved in 1973 by Kleitman and Wang that for any graphic sequence all elimination algorithms, i.e. laying-off vertices in any order, preserve that the sequence is graphic and terminate in a sequence of zeros. We now prove that for any degree sequence, the elimination sequence derived from the Havel-Havel algorithm dominates all other elimination sequences. Our result implies a conjecture posed by Michael Barrus in 2010: When iteratively laying off degrees from a graphic sequence until only a list of zeros remains, the number of zeros is at most the residue of this sequence.