An Improved Algorithm for Counting Graphical Degree Sequences

Kai Wang, Troy Purvis

We present an improved version of a previous efficient algorithm that computes the number $D(n)$ of zero-free graphical degree sequences of length $n$. A main ingredient of the imp…