Степенные множества графов и гамильтоновость

Abstract

The problem of determining the minimum order of Hamiltonian graphs with a prescribed degree set S is completely solved. All such pairs (S, p) are described, for which there exists a p-vertex traceable graph with degree set S.