The supereulerian index of a graph is the smallest integer such that the -th iterated line graph of is supereulerian. We first show that adding an edge between two vertices with degree sums at least three in a graph cannot increase its supereulerian index. We use this result to prove that the supereulerian index of a graph will not be changed after either of contracting an -contractible subgraph of a graph and performing the closure operation on (if is claw-free). Our results extend Catlin’s remarkable theorem relating that the supereulericity of a graph is stable under the contraction of a collapsible subgraph.