On equivalence of realizability conditions of a degree sequence

Wai‐Kai Chen · IEEE Transactions on Circuit Theory · 1973

It is shown that the realizability conditions of Erdös and Gallai for a sequence of nonnegative integers to be the degrees of a graph having no parallel edges and self-loops can be deduced from those for a directed graph.

Read the paper · More papers on PaperTik