A vertex-deleted subgraph (or card) of a graph G is obtained from G by deleting the vertex v and all edges incident to v. In this paper, we prove that for all graphs on seven or more vertices, the degree sequence can be reconstructed from any (n - 1)-subset of the cards where n is the number of vertices of G.