# zbMATH — the first resource for mathematics

Parallel enumeration of degree sequences of simple graphs. (English) Zbl 1305.05089
Summary: The problem of testing, reconstruction and enumeration of the degree sequences of simple graphs has rich bibliography. In this paper we report on the parallel enumeration of the degree sequences of simple graphs resulting the number of sequences for $$n = 24,\dots, 29$$ vertices. We also present the linear test version of Havel-Hakimi algorithm and compare it with the earlier linear testing algorithms.

##### MSC:
 05C20 Directed graphs (digraphs), tournaments 05C85 Graph algorithms (graph-theoretic aspects) 05C05 Trees