1 paper
Gilead Levy
An integer partition of n is called graphical if its parts form a degree sequence of a simple graph. While unrestricted graphical partitions have been extensively studied, much l…