A degree sequence which is realisable by a -uniform hypergraph is called -graphic. Seven necessary conditions, one sufficient condition, and one equivalent condition for degree sequences to be -graphic are derived. Moreover, four special classes of degree sequences are examined. For each class an equivalent condition for the sequences in this class to be -graphic is derived. Using these conditions, all the -graphic degree sequences of length at most seven have been determined.
