4 papers
k-connected degree sequences
Jonathan McLaughlin
Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a k-connected simple graph are detailed. Conditions are also given under which…
3-connected graphs and their degree sequences
Jonathan McLaughlin
Necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a 3-connected simple graph are detailed. Conditions are also given under which…
On connected simple graphs and their degree sequences
Jonathan McLaughlin
This note describes necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a connected simple graph. Conditions are also given under w…
On connected degree sequences
Jonathan McLaughlin
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 pape…