Necessary and sufficient conditions for the existence of a p-connected (linear undirected) graph with prescribed degrees d1,d2,⋯,dn are known for p = 1,2. In this paper we solve this problem for p = 3.
© Copyright 1970 Pacific Journal of Mathematics. All rights reserved.