A sequence of integers \(d_1,\dots,d_n\) is called **graphical**
if there exists a graph \(G\) with it as its degree sequence. A
theorem by Erdős and Gallai characterizes which sequences are graphical, but gives no
algorithm to explicitly construct such a graph.

Can *you* construct the graph given its degree sequence? Click and drag
from a node to another to build a link, select a link and press backspace to
delete it.