k-connected degree sequences
classification
🧮 math.CO
keywords
k-connectedsequenceconditionsdegreedetailedgivengraphintegers
read the original abstract
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 such a sequence is necessarily k-connected.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.