1. Degree multisets of hypergraphs;Billington,1981
2. Embedding partial Steiner triple systems is NP-complete;Colbourn;J. Combin. Theory (A),1983
3. Graphs with prescribed degrees of vertices (Hungarian);Erdös;Math. Lapok.,1960
4. Computers and Intractability − A Guide to the Theory of NP-Completeness;Garey,1979
5. On the realizability of a set of integers as degrees of the vertices of a linear graph I;Hakimi;J. SIAM,1962