Let be the complete graph on vertices and let be a non-increasing sequence of nonnegative integers. If has a realization containing as a subgraph, then is said to be potentially -graphic. A.R. Rao obtained an Erdős-Gallai type criterion for to be potentially -graphic. In this paper, we provide a simplification of this Erdős-Gallai type criterion. Additionally, we present the Fulkerson-Hoffman-McAndrew type criterion and the Hasselbarth type criterion for to be potentially -graphic.