2015/11/30 by McLaughlin, Jonathan
#05C40 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1511.09321
This note gives necessary and sufficient conditions for a sequence of non-negative integers to be the degree sequence of a connected simple graph. This result is implicit in a paper of Hakimi. A new alternative characterisation of these necessary and sufficient conditions is also given.