In network theory myriad of real life networks are acquired and studied. The typical way of these studies is based on generating synthetic assemblies of networks (in accordance with some assumed models) and comparing the outcomes with the original object.

One of the most simple models to build networks is based on degree sequences. In this talk we'll discuss some realization and listing type problems for different degree sequence types. The discussion is based only on combinatorial methods.