1. Degree-constrained edge partitioning in graphs arising from discrete tomography;Bentz;J. Graph Algorithms Appl.,2009
2. Unicyclic realizability of a degree list;Boesch;Networks,1978
3. Packing of graphic n-tuples;Busch;J. Graph Theory,2012
4. J. Carroll, G. Isaak, Degree matrices realized by edge-colored forests. http://www.lehigh.edu/~gi02/ecforest.pdf, 2009 (accessed 03.07 2012).
5. Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms;Chrobak,1998